Search results for "Polygons"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
100	Moshe Dror, Alon Efrat, Anna Lubiw, Joseph S. B. Mitchell	Touring a sequence of polygons.	STOC	2003	DBLP DOI BibTeX RDF	safari route, watchman route, shortest path, NP-hardness, traveling salesman problem, polygons
77	Borut Zalik	A fast algorithm for an envelope construction of a huge set of topologically consistent polygons.	Eng. Comput.	2003	DBLP DOI BibTeX RDF	Two-level uniform subdivision, Algorithms, Computational geometry, Polygons, Envelope
77	Youdong Liang, Hujun Bao, Weihua Zhou	A Morphing with Geometric Continuity between Two Arbitrary Planar Polygons.	PG	2002	DBLP DOI BibTeX RDF	Frenet frames, Rotation indexes and Winding numbers, Morphing, Polygons, Geometric Continuity
75	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
75	Ivan Stojmenovic	Detecting intersection of two convex polygons in parallel.	ACM Conference on Computer Science	1988	DBLP DOI BibTeX RDF
69	Deepti Joshi, Ashok Samal, Leen-Kiat Soh	A dissimilarity function for clustering geospatial polygons.	GIS	2009	DBLP DOI BibTeX RDF	clustering, polygons, spatial data mining, regionalization
67	Yong-Xi Gong, Yu Liu 0003, Lun Wu, Yu-Bo Xie	Boolean Operations on Conic Polygons.	J. Comput. Sci. Technol.	2009	DBLP DOI BibTeX RDF	conic polygon, Boolean operation, topological relationship
67	Robert A. Reckhow, Joseph C. Culberson	Covering a Simple Orthogonal Polygon with a Minimum Number of Orthogonally Convex Polygons.	SCG	1987	DBLP DOI BibTeX RDF
61	Sasipalli V. S. Rao, Harada Koichi	Reversibly Visible Polygons and Polygonal Approximation in Two Dimensional Space.	Computer Graphics International	1997	DBLP DOI BibTeX RDF	Polygonal line, windows in the edges, reversibly visible polygons, approximation
59	Wenjuan Gong, Changhe Tu	Continuous Collision Detection between Two 2DCurved-Edge Polygons under Rational Motions.	GMP	2008	DBLP DOI BibTeX RDF	conic splines, rational motion, continuous collision detection
59	Helmut Alt, Ferran Hurtado	Packing Convex Polygons into Rectangular Boxes.	JCDCG	2000	DBLP DOI BibTeX RDF
59	Claudio Esperança, Hanan Samet	Orthogonal Polygons as Bounding Structures in Filter-Refine Query Processing Strategies.	SSD	1997	DBLP DOI BibTeX RDF
59	Christos Levcopoulos, Andrzej Lingas	Bounds on the Length of Convex Partitions of Polygons.	FSTTCS	1984	DBLP DOI BibTeX RDF
55	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
55	Karl Rehmer, Linda Rising	A geometry package in Ada (abstract only).	ACM Conference on Computer Science	1987	DBLP DOI BibTeX RDF	Ada
53	Evgeny Lipovetsky, Nira Dyn	An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphing.	Adv. Comput. Math.	2007	DBLP DOI BibTeX RDF	metric average, linear time complexity, morphing, convex polygons
52	Hongjun Zhu, Jianwen Su, Oscar H. Ibarra	Extending Rectangle Join Algorithms for Rectilinear Polygons.	Web-Age Information Management	2000	DBLP DOI BibTeX RDF
52	Leonidas J. Guibas, Jack Snoeyink, Li Zhang 0001	Compact Voronoi Diagrams for Moving Convex Polygons.	SWAT	2000	DBLP DOI BibTeX RDF
52	Svante Carlsson, Bengt J. Nilsson	Computing Vision Points in Polygons.	Algorithmica	1999	DBLP DOI BibTeX RDF	Art gallery problems, Algorithms, Computational geometry
52	Günther Greiner, Kai Hormann	Efficient Clipping of Arbitrary Polygons.	ACM Trans. Graph.	1998	DBLP DOI BibTeX RDF	polygon comparison, clipping
52	Michal Etzion, Ari Rappoport	On Compatible Star Decompositions of Simple Polygons.	IEEE Trans. Vis. Comput. Graph.	1997	DBLP DOI BibTeX RDF	Star decomposition, minimal star decomposition, compatible decompositions, compatible star decompositions
52	Amitava Datta, Christoph A. Hipke, Sven Schuierer	Competitive Searching in Polygons - Beyond Generalised Streets.	ISAAC	1995	DBLP DOI BibTeX RDF
52	Lin-Lin Chen, Shuo-Yan Chou, Tony C. Woo	Separating and Intersecting Spherical Polygons: Computing Machinability on Three-, Four-, and Five-axis Numerically Controlled Machines.	ACM Trans. Graph.	1993	DBLP DOI BibTeX RDF	densest hemisphere, minimal/maximal intersection, numerically controlled machining, spherical algorithm, visibility algorithm, separation, bisection
52	David M. Mount	Intersection Detection and Separators for Simple Polygons.	SCG	1992	DBLP DOI BibTeX RDF
50	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
49	Arne Schuldt, Björn Gottfried, Otthein Herzog	A compact shape representation for linear geographical objects: the scope histogram.	GIS	2006	DBLP DOI BibTeX RDF	bipartite arrangements, linear objects, qualitative shape description, scope histogram, geographic information systems, image retrieval, polygons
48	Rajeev Motwani 0001, Arvind Raghunathan, Huzur Saran	Covering Orthogonal Polygons with Star Polygons: The Perfect Graph Approach.	SCG	1988	DBLP DOI BibTeX RDF
47	Stephan J. Eidenbenz, Christoph Stamm	MAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility Graphs.	IFIP TCS	2000	DBLP DOI BibTeX RDF
45	I-Lun Tseng, Adam Postula	Partitioning parameterized 45-degree polygons with constraint programming.	ACM Trans. Design Autom. Electr. Syst.	2008	DBLP DOI BibTeX RDF	Parameterized polygons, analog and mixed-signal design, parameterized layouts, trapezoidal corner stitching, polygon decomposition
45	Paolo Gronchi, Marco Longinetti	Affinely Regular Polygons as Extremals of Area Functionals.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF	Affinely regular polygons, Geometric tomography, Affine length
45	Michael S. Floater, Kai Hormann, Géza Kós	A general construction of barycentric coordinates over convex polygons.	Adv. Comput. Math.	2006	DBLP DOI BibTeX RDF	rational polynomials, convex polygons, barycentric coordinates
45	I-Lun Tseng, Adam Postula	An efficient algorithm for partitioning parameterized polygons into rectangles.	ACM Great Lakes Symposium on VLSI	2006	DBLP DOI BibTeX RDF	corner stitching, parameterized layouts, parameterized polygons, polygon decomposition
45	Jovisa D. Zunic, Paul L. Rosin	A Rectilinearity Measurement for Polygons.	ECCV (2)	2002	DBLP DOI BibTeX RDF	rectilinearity, measurement, Shape, polygons
44	Josef Kallrath	Cutting circles and polygons from area-minimizing rectangles.	J. Glob. Optim.	2009	DBLP DOI BibTeX RDF	Non-overlap constraints, Global Optimization, Mixed integer programming, Assignment, Packing problem, Cutting stock problem, Shape constraints, Design problem
44	Ana Paula Tomás, António Leslie Bajuelos	Generating Random Orthogonal Polygons.	CAEPIA	2003	DBLP DOI BibTeX RDF
44	Atsushi Imiya, S. Kudo	Docking of Polygons Using Boundary Descriptor.	CAIP	2003	DBLP DOI BibTeX RDF
44	Atef Bel Hadj Ali	Moment representation of polygons for the assessment of their shape quality.	J. Geogr. Syst.	2002	DBLP DOI BibTeX RDF
44	Arijit Laha, Amitava Sen, Bhabani P. Sinha	Parallel Algorithms for Identification of Basis Polygons in an Image.	HiPC	2002	DBLP DOI BibTeX RDF
44	Zhenyu Li, Victor Milenkovic	A Compaction Algorithm for Non-Convex Polygons and Its Application.	SCG	1993	DBLP DOI BibTeX RDF
44	Mark de Berg	Translating Polygons with Applications to Hidden Surface Removal.	SWAT	1990	DBLP DOI BibTeX RDF	separation problems, relative convex hulls, Computational geometry, hidden surface removal
44	Frank K. H. A. Dehne, Jörg-Rüdiger Sack	Seperability of Sets of Polygons.	WG	1986	DBLP DOI BibTeX RDF
41	Martin Paluszewski, Pawel Winter, Martin Zachariasen	A new paradigm for general architecture routing.	ACM Great Lakes Symposium on VLSI	2004	DBLP DOI BibTeX RDF	Steiner trees in uniform orientation metrics, flexibility polygons, non-manhattan routing, VLSI routing
41	Danny Z. Chen, Xiaobo Hu 0001, Shuang Luan, Chao Wang 0002, Xiaodong Wu 0001	Geometric algorithms for static leaf sequencing problems in radiation therapy.	SCG	2003	DBLP DOI BibTeX RDF	leaf sequencing, monotone polygons, polygon partition, network flows, radiation therapy, IMRT
39	Timothy G. Abbott, Zachary Abel, David Charlton, Erik D. Demaine, Martin L. Demaine, Scott Duke Kominers	Hinged dissections exist.	SCG	2008	DBLP DOI BibTeX RDF	hinging, motion
39	Nick Barnes, Gareth Loy, David Shaw, Antonio Robles-Kelly	Regular Polygon Detection.	ICCV	2005	DBLP DOI BibTeX RDF
39	Kagenori Kajihara, Hiroki Takahashi, Masayuki Nakajima 0001	A Method of Rendering Scenes Including Volumetric Objects Using Ray-Volume Buffers - Expanding to Render Scenes Including Overlapped Volumetric Object.	Computer Graphics International	2003	DBLP DOI BibTeX RDF
39	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
39	Stephan J. Eidenbenz, Peter Widmayer	An Approximation Algorithm for MINIMUM CONVEX COVER with Logarithmic Performance Guarantee.	ESA	2001	DBLP DOI BibTeX RDF
39	Pankaj K. Agarwal, Eyal Flato, Dan Halperin	Polygon Decomposition for Efficient Construction of Minkowski Sums.	ESA	2000	DBLP DOI BibTeX RDF
39	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)
39	Kurt Mehlhorn, Chee-Keng Yap	Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves.	ICALP	1988	DBLP DOI BibTeX RDF
39	Larry Bergman, Henry Fuchs, Eric D. Grant, Susan Spach	Image rendering by adaptive refinement.	SIGGRAPH	1986	DBLP DOI BibTeX RDF
38	Vincent Pilaud, Francisco Santos	Multitriangulations as Complexes of Star Polygons.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	Generalized triangulation, Crossing-free graph, Star polygons, Flips, Associahedron
38	Kevin Buchin, Maike Buchin, Carola Wenk	Computing the Fréchet distance between simple polygons in polynomial time.	SCG	2006	DBLP DOI BibTeX RDF	Fréchet distance, shape matching, simple polygons
38	Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe	Exploring Simple Grid Polygons.	COCOON	2005	DBLP DOI BibTeX RDF	grid polygons, lower bounds, online algorithms, competitive analysis, exploration, Robot navigation, covering
38	Mario Alberto López, Dinesh P. Mehta	Efficient decomposition of polygons into L-shapes with application to VLSI layouts.	ACM Trans. Design Autom. Electr. Syst.	1996	DBLP DOI BibTeX RDF	L-shapes, corner stitching, partition, rectangle, rectilinear polygons
36	Therese C. Biedl, Stephane Durocher, Jack Snoeyink	Reconstructing Polygons from Scanner Data.	ISAAC	2009	DBLP DOI BibTeX RDF
36	Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc	Optimality and Competitiveness of Exploring Polygons by Mobile Robots.	ESA	2009	DBLP DOI BibTeX RDF
36	Vadim Trofimov, Kira Vyatkina	Linear Axis for General Polygons: Properties and Computation.	ICCSA (1)	2007	DBLP DOI BibTeX RDF
36	Siddharth Manay, David W. Paglieroni	Matching Flexible Polygons to Fields of Corners Extracted from Images.	ICIAR	2007	DBLP DOI BibTeX RDF	Corner Extraction, Polygon Extraction, Overhead Imagery
36	Kai Hormann, Michael S. Floater	Mean value coordinates for arbitrary planar polygons.	ACM Trans. Graph.	2006	DBLP DOI BibTeX RDF	interpolation, Barycentric coordinates
36	Véronique Delouille, Ramesh Neelamani, Richard G. Baraniuk	Robust distributed estimation in sensor networks using the embedded polygons algorithm.	IPSN	2004	DBLP DOI BibTeX RDF	matrix splitting, sensor networks, hidden Markov models, graphical models, Wiener filter, distributed estimation
36	Therese C. Biedl, Anna Lubiw, Michael J. Spriggs	Angles and Lengths in Reconfigurations of Polygons and Polyhedra.	MFCS	2004	DBLP DOI BibTeX RDF
36	Jan Kratochvíl, Martin Pergel	Two Results on Intersection Graphs of Polygons.	GD	2003	DBLP DOI BibTeX RDF
36	Niklas Elmqvist, Philippas Tsigas	Causality Visualization Using Animated Growing Polygons.	INFOVIS	2003	DBLP DOI BibTeX RDF	information visualization, interactive animation, causal relations
36	Gian Paolo Lorenzetto, Amitava Datta	A Linear Time Heuristics for Trapezoidation of GIS Polygons.	International Conference on Computational Science (3)	2002	DBLP DOI BibTeX RDF
36	Kokichi Sugihara	Invertible Minkowski Sum of Polygons.	DGCI	2002	DBLP DOI BibTeX RDF
36	Jin Akiyama, Gisaku Nakamura	Dudeney Dissections of Polygons and Polyhedrons - A Survey.	JCDCG	2000	DBLP DOI BibTeX RDF
36	David G. Kirkpatrick, Bettina Speckmann	Separation Sensitive Kinetic Separation Structures for Convex Polygons.	JCDCG	2000	DBLP DOI BibTeX RDF
36	M. Carmen Hernando, Michael E. Houle, Ferran Hurtado	On Local Transformation of Polygons with Visibility Properties.	COCOON	2000	DBLP DOI BibTeX RDF
36	Amitava Datta, Kamala Krithivasan, Thomas Ottmann	An Optimal Algorithm for One-Separation of a Set of Isothetic Polygons.	CIAC	1997	DBLP DOI BibTeX RDF
36	G. MacDonald, Thomas C. Shermer	Isomorphism of Spiral Polygons.	Discret. Comput. Geom.	1996	DBLP DOI BibTeX RDF
36	Eric Andres, Claudio H. Sibata, Raj Acharya	Supercover 3D polygons.	DGCI	1996	DBLP DOI BibTeX RDF
36	Gert Vegter	Kink-Free Deformations of Polygons.	SCG	1989	DBLP DOI BibTeX RDF
36	Cao An Wang, Edward P. F. Chan	Finding the Minimum Visible Vertex Distance Between Two Non-Intersecting Simple Polygons.	SCG	1986	DBLP DOI BibTeX RDF
36	Guy Bruno Jr., Walter G. Rudd	A similarity index for convex polygons (abstract only).	ACM Conference on Computer Science	1985	DBLP DOI BibTeX RDF
36	Christos Levcopoulos, Andrzej Lingas	Covering Polygons with Minimum Number of Rectangles.	STACS	1984	DBLP DOI BibTeX RDF
33	Michael A. Bekos, Michael Kaufmann 0001, Katerina Potika, Antonios Symvonis	Polygon labelling of minimum leader length.	APVIS	2006	DBLP DOI BibTeX RDF	boundary labelling, floating sites, polygons, map labelling
33	Ioannis P. Ivrissimtzis, Rhaleb Zayer, Hans-Peter Seidel	Polygonal Decomposition of the 1-Ring Neighborhood of the Catmull-Clark Scheme.	SMI	2004	DBLP DOI BibTeX RDF	evolving polygons, Catmull-Clark, circulant-block matrices, subdivision
33	Zhunping Zhang, Lifeng Wang 0001, Baining Guo, Heung-Yeung Shum	Feature-based light field morphing.	ACM Trans. Graph.	2002	DBLP DOI BibTeX RDF	3D morphing, feature polygons, global visibility map, ray correspondence, ray-space warping, light field
33	Roop K. Goyal, Max J. Egenhofer	Consistent Queries over Cardinal Directions across Different Levels of Detail.	DEXA Workshops	2000	DBLP DOI BibTeX RDF	cardinal directions, geometric data types, deep direction-relation matrix, spatial query languages, geographic information systems, geographic information system, spatial database, polygons, query formulation
31	Sándor P. Fekete, Joseph S. B. Mitchell, Christiane Schmidt 0001	Minimum Covering with Travel Cost.	ISAAC	2009	DBLP DOI BibTeX RDF
31	Danny Z. Chen, Ewa Misiolek	Free-Form Surface Partition in 3-D.	ISAAC	2008	DBLP DOI BibTeX RDF
31	Ron Wein	Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method.	ESA	2006	DBLP DOI BibTeX RDF
31	Jun Lee, Sungjun Park, Jee-In Kim	Adaptive Real-Time Rendering for Large-Scale Molecular Models.	ISVC (2)	2006	DBLP DOI BibTeX RDF
31	Jie Wu 0001, Zhen Jiang	On constructing the minimum orthogonal convex polygon for the fault-tolerant routing in 2-D faulty meshes.	IEEE Trans. Reliab.	2005	DBLP DOI BibTeX RDF
31	Gereon Frahling, Jens Krokowski	Online Occlusion Culling.	ESA	2005	DBLP DOI BibTeX RDF
31	Vitaly Surazhsky, Craig Gotsman	High quality compatible triangulations.	Eng. Comput.	2004	DBLP DOI BibTeX RDF	Compatible triangulations, Low discrepancy point sets, Sweep meshes, Morphing, Remeshing
31	Mirela Damian, Sriram V. Pemmaraju	Computing Optimal Diameter-Bounded Polygon Partitions.	Algorithmica	2004	DBLP DOI BibTeX RDF	Diameter-bounded, Approximation algorithm, Polygon decomposition
31	Jie Wu 0001, Zhen Jiang	On Constructing the Minimum Orthogonal Convex Polygon in 2-D Faulty Meshes.	IPDPS	2004	DBLP DOI BibTeX RDF
31	Rodrigo Salvador Monteiro, Leonardo Guerreiro Azevedo, Geraldo Zimbrao, Jano Moreira de Souza	Polygon and Polyline Join Using Raster Filters.	DASFAA	2004	DBLP DOI BibTeX RDF	raster approximations, geometric filters, spatial databases, Spatial join
31	Q. Li, Sung-Mo Kang	Trapezoid-to-simple polygon recomposition for resistance extraction.	ISCAS (5)	2001	DBLP DOI BibTeX RDF
31	Erlend Tøssebro, Ralf Hartmut Güting	Creating Representations for Continuously Moving Regions from Observations.	SSTD	2001	DBLP DOI BibTeX RDF
31	Michaël Chelle, Bruno Andrieu, Kadi Bouatouch	Nested radiosity for plant canopies.	Vis. Comput.	1998	DBLP DOI BibTeX RDF	Nested model, Vegetation, Validation, Global illumination, Radiosity
31	Christos Levcopoulos, Anna Östlin	Linear-Time Heuristics for Minimum Weight Rectangulation (Extended Abstract).	SWAT	1996	DBLP DOI BibTeX RDF
31	Wei-pang Chin, Simeon C. Ntafos	Optimum Watchman Routes.	SCG	1986	DBLP DOI BibTeX RDF
30	Dan Ismailescu	Circumscribed Polygons of Small Area.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	Convex regions, Circumscribed polygons
30	Ioannis P. Ivrissimtzis, Hans-Peter Seidel	Evolutions of Polygons in the Study of Subdivision Surfaces.	Computing	2004	DBLP DOI BibTeX RDF	evolving polygons, Subdivision, circulant matrices
30	Jovisa D. Zunic, Paul L. Rosin	Rectilinearity Measurements for Polygons.	IEEE Trans. Pattern Anal. Mach. Intell.	2003	DBLP DOI BibTeX RDF	rectilinearity, measurement, Shape, polygons
30	Peter Schröder, Pat Hanrahan	On the form factor between two polygons.	SIGGRAPH	1993	DBLP DOI BibTeX RDF	polygons, closed form solution, form factor