Search results for "Polygon"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
119	Karl Rehmer, Linda Rising	A geometry package in Ada (abstract only).	ACM Conference on Computer Science	1987	DBLP DOI BibTeX RDF	Ada
87	Yee Leung, Jiang-Hong Ma, Michael F. Goodchild	A general framework for error analysis in measurement-based GIS Part 2: The algebra-based probability model for point-in-polygon analysis.	J. Geogr. Syst.	2004	DBLP DOI BibTeX RDF	JEL Classification C10, C15, C31
87	Chui Kwan Cheung, Wenzhong Shi, Xian Zhou 0002	A Probability-based Uncertainty Model for Point-in-Polygon Analysis in GIS.	GeoInformatica	2004	DBLP DOI BibTeX RDF	positional uncertainty, point-in-polygon analysis, GIS, error propagation
75	R. Shantaram, John Stewart	An algorithm to minimally decompose a rectilinear figure into rectangles (abstract only).	ACM Conference on Computer Science	1987	DBLP DOI BibTeX RDF
66	Marko Lamot, Borut Zalik	An Overview of Triangulation Algorithms for Simple Polygons.	IV	1999	DBLP DOI BibTeX RDF	simple polygon triangulation, triangulation, Delaunay triangulation, simple polygon, Steiner points, polygon decomposition
65	David Eppstein, Michael T. Goodrich, Nodari Sitchinava	Guard placement for efficient point-in-polygon proofs.	SCG	2007	DBLP DOI BibTeX RDF	angle guards, art gallery problem, floodlights, approximation algorithm, localization
65	Cornelius W. A. M. van Overveld, Brian Wyvill	An Algorithm for Polygon Subdivision Based on Vertex Normals.	Computer Graphics International	1997	DBLP DOI BibTeX RDF
65	Chen Tet-Khuan, Alias Abdul-Rahman	0-D Feature in 3D Planar Polygon Testing for 3D Spatial Analysis.	3D-GIS	2006	DBLP DOI BibTeX RDF	0D feature, 3D planar polygon, 3D GIS
65	Leonidas Palios	A New Competitive Strategy for Reaching the Kernel of an Unknown Polygon.	SWAT	2000	DBLP DOI BibTeX RDF	curve with increasing chords, kernel, Motion planning, simple polygon, competitive algorithm
63	Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron	Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon.	COCOON	2004	DBLP DOI BibTeX RDF
63	Hsuan-Shih Lee, Ruei Chuan Chang	Approximating Vertices of a Convex Polygon with Grid Points in the Polygon.	ISAAC	1992	DBLP DOI BibTeX RDF
59	Hossam A. ElGindy, David Avis, Godfried T. Toussaint	Applications of a two-dimensional hidden-line algorithm to other geometric problems.	Computing	1983	DBLP DOI BibTeX RDF	L-convex polygon, edge visible polygon, algorithms, triangulation, Visibility, convex hull, simple polygon, geometric complexity
58	Francis Y. L. Chin, Cao An Wang	Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons.	IEEE Trans. Computers	1983	DBLP DOI BibTeX RDF	nonconvex polygon, planar polygon, polygon intersection, Computation geometry, minimum distance, convex polygon, unimodal
58	Alon Efrat, Leonidas J. Guibas, Sariel Har-Peled, Joseph S. B. Mitchell, T. M. Murali 0001	New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping.	Discret. Comput. Geom.	2002	DBLP DOI BibTeX RDF
58	Ediz Saykol, Gürcan Gülesir, Ugur Güdükbay, Özgür Ulusoy	KiMPA: A Kinematics-Based Method for Polygon Approximation.	ADVIS	2002	DBLP DOI BibTeX RDF
58	Binay K. Bhattacharya, Asish Mukhopadhyay	Computing in Linear Time a Chord from Which a Simple Polygon is Weakly Internally Visible.	ISAAC	1995	DBLP DOI BibTeX RDF
57	Bengt-Olaf Schneider, Jim van Welzen	Efficient Polygon Clipping for an SIMD Graphics Pipeline.	IEEE Trans. Vis. Comput. Graph.	1998	DBLP DOI BibTeX RDF	single-instruction multiple-data (SIMD) computer, deferred clipping, clip-plane pairs, edge batching, perspective projection, Polygon clipping
57	Chandrasekhar Narayanaswami 0001	A parallel polygon-clipping algorithm.	Vis. Comput.	1996	DBLP DOI BibTeX RDF	vertex labeling, parallel, multithreading, Polygon clipping, polygon clipping, polygon clipping
55	Wael M. Badawy, Walid G. Aref	On Local Heuristics to Speed Up Polygon-Polygon Intersection Tests.	ACM-GIS	1999	DBLP DOI BibTeX RDF	polygon-polygon intersection, query processing, spatial databases
52	Mohammad Tanvir Parvez, Md. Saidur Rahman 0001, Shin-Ichi Nakano	Generating All Triangulations of Plane Graphs (Extended Abstract).	WALCOM	2009	DBLP DOI BibTeX RDF	Genealogical Tree, Graph, Triangulation, Polygon, Plane Graph
52	Alireza Zarei, Mohammad Ghodsi	Efficient computation of query point visibility in polygons with holes.	SCG	2005	DBLP DOI BibTeX RDF	polygon with holes, visibility decomposition, visibility polygon
52	Fu Chang, Yung-Ping Cheng, Theodosios Pavlidis, Tsuey-Yuh Shuai	A line sweep thinning algorithm.	ICDAR	1995	DBLP DOI BibTeX RDF	line sweep thinning algorithm, line sweep procedures, parallel slabs, object contours, polygon sides, object decomposition, pattern recognition operations, image segmentation, character recognition, character recognition, image representation, conflict resolution, regions, polygon approximation, junction, generic types
50	Yongqiang Lu 0001, Qing Su, Jamil Kawa	An innovative Steiner tree based approach for polygon partitioning.	ASP-DAC	2008	DBLP DOI BibTeX RDF
50	Por-Shen Lai, Hsin-Chia Fu	A polygon description based similarity measurement of stock market behavior.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
50	Jo Skjermo, Ole Christian Eidheim	Polygon Mesh Generation of Branching Structures.	SCIA	2005	DBLP DOI BibTeX RDF
50	Danny Z. Chen, Xiaobo Hu 0001, Xiaodong Wu 0001	Optimal Polygon Cover Problems and Applcations.	ISAAC	2000	DBLP DOI BibTeX RDF
50	Ge Song, Hong Wang 0004, Miao Hao, Zengqi Sun	A Polygon Detection Algorithm for Robot Visual Servoing.	ICIRA (1)	2008	DBLP DOI BibTeX RDF	Polygon Detection, Robot Visual Servoing, Contours, RANSAC, Parallel Thinning
50	Fajie Li, Reinhard Klette	Decomposing a Simple Polygon into Trapezoids.	CAIP	2007	DBLP DOI BibTeX RDF	rubberband algorithm, computational geometry, simple polygon, Euclidean shortest path
50	Xiaofang Zhou 0001, David Truffet, Jiawei Han 0001	Efficient Polygon Amalgamation Methods for Spatial OLAP and Spatial Data Mining.	SSD	1999	DBLP DOI BibTeX RDF	polygon amalgamation, spatial databases, spatial indexing, on-line analytical processing (OLAP)
48	Reza Dorrigiv, Stephane Durocher, Arash Farzan, Robert Fraser, Alejandro López-Ortiz, J. Ian Munro, Alejandro Salinger, Matthew Skala	Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance.	WADS	2009	DBLP DOI BibTeX RDF
45	Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc	Optimality and Competitiveness of Exploring Polygons by Mobile Robots.	ESA	2009	DBLP DOI BibTeX RDF
45	Menelaos I. Karavelas	Guarding curvilinear art galleries with edge or mobile guards.	Symposium on Solid and Physical Modeling	2008	DBLP DOI BibTeX RDF	2-dominance, curvilinear polygons, diagonal guards, edge guards, mobile guards, piece-wise-convex polygons, triangulation graphs, art gallery
45	Sheung-Hung Poon	On Unfolding Lattice Polygons/Trees and Diameter-4 Trees.	COCOON	2006	DBLP DOI BibTeX RDF	Comput. geom., straightening, convexifying, unfolding
45	Zhenyu Liu, Dimitrios A. Pados	LDPC codes from generalized polygons.	IEEE Trans. Inf. Theory	2005	DBLP DOI BibTeX RDF
45	Partha Bhowmick, Bhargab B. Bhattacharya	Approximation of Digital Circles by Regular Polygons.	ICAPR (1)	2005	DBLP DOI BibTeX RDF
45	Christodoulos Fragoudakis, Euripides Markou, Stathis Zachos	How to Place Efficiently Guards and Paintings in an Art Gallery.	Panhellenic Conference on Informatics	2005	DBLP DOI BibTeX RDF
45	Jovisa D. Zunic, Paul L. Rosin	A Rectilinearity Measurement for Polygons.	ECCV (2)	2002	DBLP DOI BibTeX RDF	rectilinearity, measurement, Shape, polygons
45	Jae-Ha Lee, Sang-Min Park, Kyung-Yong Chwa	Optimization Algorithms for Sweeping a Polygonal Region with Mobile Guards.	ISAAC	2001	DBLP DOI BibTeX RDF
45	Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad	Visibility with One Reflection.	Discret. Comput. Geom.	1998	DBLP DOI BibTeX RDF
45	Thorsten Graf, Kamakoti Veezhinathan	Reducing Simple Polygons to Triangles - A Proof for an Improved Conjecture.	ICALP	1998	DBLP DOI BibTeX RDF
45	Sándor P. Fekete, William R. Pulleyblank	Area Optimization of Simple Polygons.	SCG	1993	DBLP DOI BibTeX RDF
45	Rajeev Motwani 0001, Arvind Raghunathan, Huzur Saran	Covering Orthogonal Polygons with Star Polygons: The Perfect Graph Approach.	SCG	1988	DBLP DOI BibTeX RDF
44	Roger White	Pattern based map comparisons.	J. Geogr. Syst.	2006	DBLP DOI BibTeX RDF	Polygon matching, Fuzzy comparison, Pattern similarity, Radial dimension, Cluster size frequency dimension
44	Ryutarou Ohbuchi, Masatoshi Nakazawa, Tsuyoshi Takei	Retrieving 3D shapes based on their appearance.	Multimedia Information Retrieval	2003	DBLP DOI BibTeX RDF	polygon soup, shape similarity search, geometric modeling, polygonal mesh, depth map, three-dimensional models
44	Sylvain Charneau, Lilian Aveneau, Laurent Fuchs	Exact, robust and efficient full visibility computation in Plücker space.	Vis. Comput.	2007	DBLP DOI BibTeX RDF	Plücker space, Polygon-to-polygon visibility, Exact solutions, Visibility precomputation, BSP-tree for CSG
44	Rolf Lakämper, Longin Jan Latecki, Xinyu Sun, Diedrich Wolter	Geometric Robot Mapping.	DGCI	2005	DBLP DOI BibTeX RDF	Polygon Merging, Perceptual Grouping, Robot Mapping, Polygon Simplification
43	Arindam Karmakar, Sasanka Roy, Sandip Das 0001	Guarding Exterior Region of a Simple Polygon.	WALCOM	2008	DBLP DOI BibTeX RDF
43	Qing-Huai Ding, J. Qian, Wai Wan Tsang, Cao An Wang	Randomly Generating Triangulations of a Simple Polygon.	COCOON	2005	DBLP DOI BibTeX RDF
43	Yinan Zhou, Zhiyong Huang	Decomposing Polygon Meshes by Means of Critical Points.	MMM	2004	DBLP DOI BibTeX RDF
43	Jairo Rocha	Efficient polygon decomposition into singular and regular regions via Voronoi diagrams.	Int. J. Document Anal. Recognit.	2003	DBLP DOI BibTeX RDF	Corridor, Skeleton, Shape analysis
43	Xuehou Tan	Searching a Simple Polygon by a k-Searcher.	ISAAC	2000	DBLP DOI BibTeX RDF
43	Ali A. Kooshesh, Bernard M. E. Moret	Folding a Triangulated Simple Polygon: Structural and Algorithmic Results.	ICCI	1991	DBLP DOI BibTeX RDF
43	Steven Fortune	A Fast Algorithm for Polygon Containment by Translation (Extended Abstract).	ICALP	1985	DBLP DOI BibTeX RDF
42	Farzad Hassanzadeh, David Rappaport	Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments.	WADS	2009	DBLP DOI BibTeX RDF	Intersecting Polygon, Approximation Algorithm, Computational Geometry, Line Segment
42	Fajie Li, Reinhard Klette	Finding the Shortest Path Between Two Points in a Simple Polygon by Applying a Rubberband Algorithm.	PSIVT	2006	DBLP DOI BibTeX RDF	rubberband algorithm, computational geometry, digital geometry, simple polygon, Euclidean shortest path
42	Junfeng Ji, Sheng Li 0008, Xuehui Liu, Enhua Wu	P-Quadtrees: A Point and Polygon Hybrid Multi-Resolution Rendering Approach.	Computer Graphics International	2004	DBLP DOI BibTeX RDF	point and polygon hybrid rendering, silhouette fidelity, LOD, quadtrees, normal mapping
42	Qiao Li, Sung-Mo Kang	Efficient algorithms for polygon to trapezoid decomposition and trapezoid corner stitching.	ACM Great Lakes Symposium on VLSI	2000	DBLP DOI BibTeX RDF	edge pair, non-Manhattan layout extraction, polygon to trapezoid decomposition, scanline algorithm, scanline interval
42	Tong-Yee Lee, Cauligi S. Raghavendra, John B. Nicholas	Image Composition Schemes for Sort-Last Polygon Rendering on 2D Mesh Multicomputers.	IEEE Trans. Vis. Comput. Graph.	1996	DBLP DOI BibTeX RDF	Sort-last-full, sort-last-sparse, polygon rendering, message-passing multicomputer system, image composition
42	Patrick-Gilles Maillot	A New, Fast Method for 2D Polygon Clipping: Analysis and Software Implementation.	ACM Trans. Graph.	1992	DBLP DOI BibTeX RDF	clipping, polygon clipping
38	David C. Wong 0002, Hassan A. Karimi	Parallel Polygon-on-Polygon and Line-in-Polygon Intersection Algorithms.	PDPTA	2000	DBLP BibTeX RDF
37	Kelun Wang, Hongxiang Ren, Shuang Wang	Study on Art Gallery Based on 4-coloring.	CGIV	2009	DBLP DOI BibTeX RDF
37	Joseph O'Rourke	Computational geometry column 51.	SIGACT News	2008	DBLP DOI BibTeX RDF
37	Sheung-Hung Poon	On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees.	COCOON	2008	DBLP DOI BibTeX RDF
37	Therese C. Biedl	Polygons Needing Many Flipturns.	Discret. Comput. Geom.	2006	DBLP DOI BibTeX RDF
37	Eunhwa Jeong, Keongho Hong	A Mechanism for Extracting Optical Virtual Contours of Discrete Dot Stimuli.	ISNN (2)	2005	DBLP DOI BibTeX RDF
37	Kazuyuki Miura, Machiko Azuma, Takao Nishizeki	Convex Drawings of Plane Graphs of Minimum Outer Apices.	GD	2005	DBLP DOI BibTeX RDF
37	Boris Aronov, Leonidas J. Guibas, Marek Teichmann, Li Zhang 0001	Visibility Queries and Maintenance in Simple Polygons.	Discret. Comput. Geom.	2002	DBLP DOI BibTeX RDF
37	R. Holley, Jerome I. Malitz, Seth M. Malitz	An Approach to Hierarchical Clustering via Level Surfaces and Convexity.	Discret. Comput. Geom.	2001	DBLP DOI BibTeX RDF
37	Günter Hotz, Steffen Lohse	Planarity Testing of Graphs on Base of a Spring Model.	GD	2001	DBLP DOI BibTeX RDF
37	Gill Barequet, Prosenjit Bose, Matthew Dickerson	Optimizing Constrained Offset and Scaled Polygonal Annuli.	WADS	1999	DBLP DOI BibTeX RDF
37	Amitava Datta, G. D. S. Ramkumar	On Some Largest Empty Orthoconvex Polygons in a Point Set.	FSTTCS	1990	DBLP DOI BibTeX RDF
37	Wei-pang Chin, Simeon C. Ntafos	Optimum Watchman Routes.	SCG	1986	DBLP DOI BibTeX RDF
37	Bernardt Duvenhage, Kadi Bouatouch, Derrick G. Kourie	Exploring the use of glossy light volumes for interactive global illumination.	Afrigraph	2010	DBLP DOI BibTeX RDF	backward polygon beam tracing, glossy, light volume, caustics
37	Sumanta Guha, Kiêu Trong Khánh	Recognizing convex polygons with few finger probes.	Pattern Anal. Appl.	2009	DBLP DOI BibTeX RDF	Finger probe, Polygon recognition, Probe-based searching, Range tree, Probing, kd-Tree
37	Fajie Li, Reinhard Klette	An Approximate Algorithm for Solving the Watchman Route Problem.	RobVis	2008	DBLP DOI BibTeX RDF	Watchman Route Problem, rubberband algorithm, computational geometry, simple polygon, visual inspection, Euclidean shortest path
37	Patricio D. Simari, Karan Singh	Extraction and remeshing of ellipsoidal representations from mesh data.	Graphics Interface	2005	DBLP BibTeX RDF	geometry representations, polygon remeshing, compression, k-means clustering, geometry processing, ellipsoid, surface segmentation
37	Charles Audet, Pierre Hansen, Frédéric Messine	Isoperimetric Polygons of Maximum Width.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	Reuleaux, Polygon, Convex polygon, Width, Perimeter
37	Hongjun Zhu, Jianwen Su, Oscar H. Ibarra	Toward Spatial Joins for Polygons.	SSDBM	2000	DBLP DOI BibTeX RDF	I/O bounded polygon, trapezoid, polygon, spatial join
35	Lawrence Hooi Tuang Chang	Blending Functions Generating a Cubic Curve that Closely Approximates a Polygon from Four Control Points.	CGIV	2009	DBLP DOI BibTeX RDF
35	John Z. Zhang	The Two-Guard Polygon Walk Problem.	TAMC	2009	DBLP DOI BibTeX RDF
35	Hee-Kap Ahn, Peter Brass, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin	Covering a Simple Polygon by Monotone Directions.	ISAAC	2008	DBLP DOI BibTeX RDF
35	Chenglei Yang, Meng Qi, Jiaye Wang, Xiaoting Wang, Xiangxu Meng	Shortest Path Queries in a Simple Polygon for 3D Virtual Museum.	ICCSA (1)	2007	DBLP DOI BibTeX RDF	Shortest Path, Voronoi Diagram, Virtual Museum
35	Mirela Tanase, Remco C. Veltkamp, Herman J. Haverkort	Multiple Polyline to Polygon Matching.	ISAAC	2005	DBLP DOI BibTeX RDF
35	Gill Barequet, Yuval Scharf, Matthew T. Dickerson	Covering points with a polygon.	SCG	2005	DBLP DOI BibTeX RDF	covering points
35	Liyan Zhang 0002, Shenglan Liu, Xi Wu, Laishui Zhou	Segmentation and Parametrization of Arbitrary Polygon Meshes.	GMP	2004	DBLP DOI BibTeX RDF	model segmentation, mesh parametrization, reverse engineering, surface fitting
35	Hidekata Hontani, Mi-Ho Giga, Yoshikazu Giga, Koichiro Deguchi	A Computation of a Crystalline Flow Starting from Non-admissible Polygon Using Expanding Selfsimilar Solutions.	DGCI	2003	DBLP DOI BibTeX RDF
35	János Pach, Gábor Tardos	Untangling a Polygon.	Discret. Comput. Geom.	2002	DBLP DOI BibTeX RDF
35	Martin Isenburg, Jack Snoeyink	Coding polygon meshes as compressable ASCII.	Web3D	2002	DBLP DOI BibTeX RDF	ASCII scene descriptions, fast and extremely light-weight decoding, non-manifold mesh encoding, mesh compression
35	Gozde B. Unal, Hamid Krim, Anthony J. Yezzi	Active Polygon for Object Tracking.	3DPVT	2002	DBLP DOI BibTeX RDF
35	Wolf-Dieter Rase	Volume-preserving interpolation of a smooth surface from polygon-related data.	J. Geogr. Syst.	2001	DBLP DOI BibTeX RDF
35	Yukio Sadahiro, Mitsuru Umemura	A computational approach for the analysis of changes in polygon distributions.	J. Geogr. Syst.	2001	DBLP DOI BibTeX RDF
35	János Pach, Gábor Tardos	Untangling a Polygon.	GD	2001	DBLP DOI BibTeX RDF
35	Karl-Friedrich Böhringer, Bruce Randall Donald, Dan Halperin	On the Area Bisectors of a Polygon.	Discret. Comput. Geom.	1999	DBLP DOI BibTeX RDF
35	Chan-Su Shin, Jung-Hyun Kim, Sung Kwon Kim, Kyung-Yong Chwa	Two-Center Problems for a Convex Polygon (Extended Abstract).	ESA	1998	DBLP DOI BibTeX RDF
35	Evanthia Papadopoulou	k-Pairs Non-Crossing Shortest Paths in a Simple Polygon.	ISAAC	1996	DBLP DOI BibTeX RDF
35	Wee-Chiew Tan, Teresa H.-Y. Meng	A low-power high performance polygon renderer for computer graphics.	J. VLSI Signal Process.	1995	DBLP DOI BibTeX RDF
35	Sven Schuierer	Computing the L1-Diameter and Center of a Simple Rectilinear Polygon in Parallel.	SWAT	1994	DBLP DOI BibTeX RDF
35	Piotr Berman, Andrzej Lingas	A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon.	SWAT	1994	DBLP DOI BibTeX RDF
35	Svante Carlsson, Håkan Jonsson 0001, Bengt J. Nilsson	Finding the Shortest Watchman Route in a Simple Polygon.	ISAAC	1993	DBLP DOI BibTeX RDF
35	Jigang Liu, Si-Qing Zheng	A simplified optimal algorithm for constructing the convex hull of a simple polygon.	ACM Southeast Regional Conference	1992	DBLP DOI BibTeX RDF