Search results for "polygons"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
30	Hubert Wagener	Optimal Parallel Hull Construction for Simple Polygons in \calO(log log n) Time	FOCS	1992	DBLP DOI BibTeX RDF	visibility region, subchain hull queries, data structure, convex hull, runtime, simple polygons, simple polygon, CRCW-PRAM, optimal parallel algorithm
30	Frank Hoffmann 0002, Michael Kaufmann 0001, Klaus Kriegel	The Art Gallery Theorem for Polygons With Holes	FOCS	1991	DBLP DOI BibTeX RDF	art gallery theorem, polygons with holes, graph-theoretic formulation, complexity analysis, open problems
30	Mihran Tüceryan, Anil K. Jain 0001	Texture Segmentation Using Voronoi Polygons.	IEEE Trans. Pattern Anal. Mach. Intell.	1990	DBLP DOI BibTeX RDF	Voronoi polygons, probabilistic relaxation labeling, pattern recognition, pattern recognition, computational geometry, picture processing, picture processing, tokens, texture segmentation, textured image, Voronoi tessellation
30	Joseph C. Culberson, Robert A. Reckhow	Covering Polygons Is Hard (Preliminary Abstract)	FOCS	1988	DBLP DOI BibTeX RDF	minimum cover problems, arbitrary polygon, orthogonal polygon, NP-hard, boundary, covering problems, convex polygons, rectangles
30	Teofilo F. Gonzalez, Si-Qing Zheng	Bounds for partitioning rectilinear polygons.	SCG	1985	DBLP DOI BibTeX RDF	approximation algrithms, partition of rectilinear polygons, polynomial time complexity
28	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
28	Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda	Algorithms for Computing Diffuse Reflection Paths in Polygons.	WALCOM	2009	DBLP DOI BibTeX RDF
28	Deepti Joshi, Ashok Samal, Leen-Kiat Soh	Density-based clustering of polygons.	CIDM	2009	DBLP DOI BibTeX RDF
28	Alexey Lvov, Ulrich Finkler	Exact basic geometric operations on arbitrary angle polygons using only fixed size integer coordinates.	ICCAD	2008	DBLP DOI BibTeX RDF
28	Rodrigo I. Silveira, Marc J. van Kreveld	Optimal Higher Order Delaunay Triangulations of Polygons.	LATIN	2008	DBLP DOI BibTeX RDF
28	Kevin Iga, Randall Maddox	Pebble Sets in Convex Polygons.	Discret. Comput. Geom.	2007	DBLP DOI BibTeX RDF
28	Eduard Oks, Micha Sharir	Minkowski Sums of Monotone and General Simple Polygons.	Discret. Comput. Geom.	2006	DBLP DOI BibTeX RDF
28	Ömer M. Soysal, Bahadir K. Gunturk, Kenneth L. Matthews II	Image Retrieval using Canonical Cyclic String Representation of Polygons.	ICIP	2006	DBLP DOI BibTeX RDF
28	Oswin Aichholzer, Clemens Huemer, Sarah Kappes, Bettina Speckmann, Csaba D. Tóth	Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles.	MFCS	2006	DBLP DOI BibTeX RDF
28	Zhenyu Liu, Dimitrios A. Pados	LDPC codes from generalized polygons.	IEEE Trans. Inf. Theory	2005	DBLP DOI BibTeX RDF
28	Bengt J. Nilsson	Approximate Guarding of Monotone and Rectilinear Polygons.	ICALP	2005	DBLP DOI BibTeX RDF
28	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
28	Xuehou Tan	Approximation Algorithms for Cutting Out Polygons with Lines and Rays.	COCOON	2005	DBLP DOI BibTeX RDF
28	Pavel Pech	Computations of the Area and Radius of Cyclic Polygons Given by the Lengths of Sides.	Automated Deduction in Geometry	2004	DBLP DOI BibTeX RDF
28	Khanh P. V. Doan	Antialiased Rendering of Self-Intersecting Polygons using Polygon Decomposition.	PG	2004	DBLP DOI BibTeX RDF
28	Jin Akiyama, Koichi Hirata, Mari-Jo P. Ruiz, Jorge Urrutia	Flat 2-Foldings of Convex Polygons.	IJCCGGT	2003	DBLP DOI BibTeX RDF
28	Toshinori Sakai, Chie Nara, Jorge Urrutia	Equal Area Polygons in Convex Bodies.	IJCCGGT	2003	DBLP DOI BibTeX RDF
28	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
28	Ren Ding, Kiyoshi Hosono, Masatsugu Urabe, Changqing Xu	Partitioning a Planar Point Set into Empty Convex Polygons.	JCDCG	2002	DBLP DOI BibTeX RDF
28	Stephan J. Eidenbenz	Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains.	SWAT	2002	DBLP DOI BibTeX RDF
28	Stephan J. Eidenbenz, Christoph Stamm, Peter Widmayer	Inapproximability Results for Guarding Polygons and Terrains.	Algorithmica	2001	DBLP DOI BibTeX RDF
28	Xuehou Tan	Finding an Optimal Bridge between Two Polygons.	COCOON	2001	DBLP DOI BibTeX RDF
28	Noel Cressie, Hal S. Stern, Deanne Reber Wright	Mapping rates associated with polygons.	J. Geogr. Syst.	2000	DBLP DOI BibTeX RDF
28	Basilios Gatos, S. L. Mantzaris	A Novel Recursive Algorithm for Area Location Using Isothetic Polygons.	ICPR	2000	DBLP DOI BibTeX RDF
28	Boris Aronov, Leonidas J. Guibas, Marek Teichmann, Li Zhang 0001	Visibility Queries in Simple Polygons and Applications.	ISAAC	1998	DBLP DOI BibTeX RDF
28	Subir Kumar Ghosh	On Recognizing and Characterizing Visibility Graphs of Simple Polygons.	Discret. Comput. Geom.	1997	DBLP DOI BibTeX RDF
28	Peter Damaschke	An Optimal Parallel Algorithm for Digital Curve Segmentation Using Hough Polygons and Monotone Function Search.	ESA	1995	DBLP DOI BibTeX RDF
28	W. T. Liou, Jimmy J. M. Tan, Richard C. T. Lee	Minimum rectangular partition problem for simple rectilinear polygons.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1990	DBLP DOI BibTeX RDF
28	Helmut Alt, Johannes Blömer, Hubert Wagener	Approximation of Convex Polygons.	ICALP	1990	DBLP DOI BibTeX RDF
28	Paul J. Heffernan, Joseph S. B. Mitchell	Structured Visibility Profiles with Applications to Problems in Simple Polygons (Extended Abstract).	SCG	1990	DBLP DOI BibTeX RDF
28	Amitava Datta, G. D. S. Ramkumar	On Some Largest Empty Orthoconvex Polygons in a Point Set.	FSTTCS	1990	DBLP DOI BibTeX RDF
28	Thomas Roos	k-Nearest-Neighbor Voronoi Diagrams for Sets of Convex Polygons, Line Segments and Points.	WG	1989	DBLP DOI BibTeX RDF
28	Hans Rohnert	Moving Discs Between Polygons.	ICALP	1988	DBLP DOI BibTeX RDF	polygonal obstacles, computational geometry, Motion Planning
28	Subir Kumar Ghosh	On Recognizing and Characterizing Visibility Graphs of Simple Polygons.	SWAT	1988	DBLP DOI BibTeX RDF
28	Christos Levcopoulos	Fast Heuristics for Minimum Length Rectangular Partitions of Polygons.	SCG	1986	DBLP DOI BibTeX RDF
28	Andrzej Lingas	On partitioning polygons.	SCG	1985	DBLP DOI BibTeX RDF
28	Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap	Finding minimal convex nested polygons.	SCG	1985	DBLP DOI BibTeX RDF
28	Jörg-Rüdiger Sack, Godfried T. Toussaint	Translating Polygons in the Plane.	STACS	1985	DBLP DOI BibTeX RDF
25	Bart Kuijpers, Bart Moelans, Nico Van de Weghe	Qualitative polyline similarity testing with applications to query-by-sketch, indexing and classification.	GIS	2006	DBLP DOI BibTeX RDF	double-cross calculus, qualitative calculi, classification, indexing, similarity, polygons, query-by-sketch, polylines
25	Marina L. Gavrilova	Two Map Labeling Algorithms for GIS Applications.	ICCSA (1)	2006	DBLP DOI BibTeX RDF	map labeling for polygons with holes, polygonal area removal, sweep algorithm, set of maximum inscribed rectangles, GIS
25	Jin-Liang Chen, Jing-Sin Liu, Wan-Chi Lee	A Recursive Algorithm for On-line Clustering Obstacles Cluttered in Dynamic Environments.	J. Intell. Robotic Syst.	2002	DBLP DOI BibTeX RDF	clustering, collision detection, dynamic environment, on-line, convex polygons
25	Siew Kei Lam, Thambipillai Srikanthan	High-Speed Environment Representation Scheme for Dynamic Path Planning.	J. Intell. Robotic Syst.	2001	DBLP DOI BibTeX RDF	environment representation, VLSI, convex polygons, visibility graph, robot path-planning
25	Xuan Liu, Shashi Shekhar, Sanjay Chawla	Consistency checking for Euclidean spatial constraints: a dimension graph approach.	ICTAI	2000	DBLP DOI BibTeX RDF	Euclidean spatial constraints, dimension graph approach, graph cycle detection, spatial predicates, two-dimensional space, computational complexity, computational geometry, transforms, polygons, consistency checking, intervals, space complexity, spatial objects
25	Stanislav Sheynin, Alexander Tuzikov, Denis Volgin	Computation of Symmetry Measures for Polygonal Shapes.	CAIP	1999	DBLP DOI BibTeX RDF	polygons, symmetry measures
25	Tamal K. Dey	Improved Bounds on Planar k-sets and k-levels.	FOCS	1997	DBLP DOI BibTeX RDF	planar k-sets, k-levels, parametric minimum spanning trees, parametric matroids, computational complexity, line segments, combinatorial complexities, convex polygons
25	Robert P. Futrelle, Nikos Nikolakis	Efficient analysis of complex diagrams using constraint-based parsing.	ICDAR	1995	DBLP DOI BibTeX RDF	complex diagrams, constraint-based parsing, constraint grammars, graphics primitives, vectorized diagrams, genetic diagrams, finite state automata diagrams, Macintosh Common Lisp, Macintosh Quadra 700, finite automata, polygons, lines, spatial indexing, electronic documents, circles, Bezier curves
25	Berrin A. Yanikoglu, Luc Vincent	Ground-truthing and benchmarking document page segmentation.	ICDAR	1995	DBLP DOI BibTeX RDF	document page segmentation, OCR output, region-based method, region misclassifications, region splitting, segmentation quality, headline detection, retyping, GroundsKeeper, document view, arbitrary polygons, benchmarking, customization, document image processing, errors, X-Window, image regions, ground-truthing, region merging
25	Ann Bengtsson, Jan-Olof Eklundh	Shape Representation by Multiscale Contour Approximation.	IEEE Trans. Pattern Anal. Mach. Intell.	1991	DBLP DOI BibTeX RDF	scale stability, multiscale contour approximation, qualitative descriptions, straight arcs, curved arcs, points delimiting the arcs, inflexion points, scale-space property of causality, computer vision, computerised picture processing, computerised pattern recognition, polygons, shape representation, corners
25	Paul Fischer, Hans Ulrich Simon	Separation Problems and Circular Arc Systems.	WG	1990	DBLP DOI BibTeX RDF	separating polygons, separating planar subdivisions, circular arc systems, number of stages, computational geometry, visibility, transversals, intersection graphs, computational learning
25	Michael E. Houle, Godfried T. Toussaint	Computing the Width of a Set.	IEEE Trans. Pattern Anal. Mach. Intell.	1988	DBLP DOI BibTeX RDF	parallel planes, pattern recognition, pattern recognition, computational complexity, computational complexity, computational geometry, computational geometry, time complexity, convex hull, set theory, polygons, point sets, 3D space
25	David P. Dobkin, Leonidas J. Guibas, John Hershberger 0001, Jack Snoeyink	An efficient algorithm for finding the CSG representation of a simple polygon.	SIGGRAPH	1988	DBLP DOI BibTeX RDF	boundary-to-CSG conversion algorithms, solid modeling, constructive solid geometry, simple polygons
25	Christian Bingane	Tight Bounds on the Maximal Area of Small Polygons: Improved Mossinghoff Polygons.	Discret. Comput. Geom.	2023	DBLP DOI BibTeX RDF
25	Christoph Koutschan, Anton Ponomarchuk, Josef Schicho	Approximation of convex polygons by polygons.	SYNASC	2021	DBLP DOI BibTeX RDF
25	R. Inkulu, K. Sowmya, Nitish P. Thakur	Dynamic Algorithms for Visibility Polygons in Simple Polygons.	Int. J. Comput. Geom. Appl.	2020	DBLP DOI BibTeX RDF
25	Elias Dahlhaus, Sariel Har-Peled, Alan L. Hu	Covering Polygons by Min-Area Convex Polygons.	CoRR	2019	DBLP BibTeX RDF
25	Hossein Boomari, Mojtaba Ostovari, Alireza Zarei	Recognizing Visibility Graphs of Polygons with Holes and Internal-External Visibility Graphs of Polygons.	CoRR	2018	DBLP BibTeX RDF
25	Chenglei Yang, Weizhen Wang, Yi-Jun Yang, Lin Lu, Zhi-Jie Zhu, Binhai Zhu, Wei Zeng 0002	Weak visibility polygons of NURBS curves inside simple polygons.	J. Comput. Appl. Math.	2014	DBLP DOI BibTeX RDF
25	Andrzej Zak	Dissections of Polygons into Convex Polygons.	Int. J. Comput. Geom. Appl.	2010	DBLP DOI BibTeX RDF
25	Gabriele Bianchi	The cross covariogram of a pair of polygons determines both polygons, with a few exceptions.	Adv. Appl. Math.	2009	DBLP DOI BibTeX RDF
25	Andrzej Lingas, Agnieszka Wasylewicz, Pawel Zylinski	Note on covering monotone orthogonal polygons with star-shaped polygons.	Inf. Process. Lett.	2007	DBLP DOI BibTeX RDF
25	Bart De Bruyn, Pieter Vandecasteele	Near polygons with a nice chain of sub-near polygons.	J. Comb. Theory, Ser. A	2004	DBLP DOI BibTeX RDF
25	Jin Akiyama, Gisaku Nakamura	Determination of All Convex Polygons which are Chameleons-Congruent Dudeney Dissections of Polygons-.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2003	DBLP BibTeX RDF
25	Yukio Sadahiro	Number of Polygons Generated by Map Overlay: The Case of Convex Polygons.	Trans. GIS	2001	DBLP DOI BibTeX RDF
25	Laxmi P. Gewali, J. Mark Keil, Simeon C. Ntafos	On covering orthogonal polygons with star-shaped polygons.	Inf. Sci.	1992	DBLP DOI BibTeX RDF
25	Robon Liu, Simeon C. Ntafos	On Partitioning Rectilinear Polygons into Star-Shaped Polygons.	Algorithmica	1991	DBLP DOI BibTeX RDF
25	Rajeev Motwani 0001, Arvind Raghunathan, Huzur Saran	Covering Orthogonal Polygons with Star Polygons: The Perfect Graph Approach.	J. Comput. Syst. Sci.	1990	DBLP DOI BibTeX RDF
25	John F. McIntosh	The interactive digitizing of polygons and the processing of polygons in a relational database.	SIGGRAPH	1978	DBLP DOI BibTeX RDF
23	Gaiane Panina, Ileana Streinu	Flattening single-vertex origami: the non-expansive case.	SCG	2009	DBLP DOI BibTeX RDF	expansive motion, spherical geometry, computational geometry, folding, origami, pseudo-triangulation
23	Alexei N. Skurikhin	Proximity Graphs Based Multi-scale Image Segmentation.	ISVC (1)	2008	DBLP DOI BibTeX RDF
23	Shinichi Fukushige, Hiromasa Suzuki	Polygon visibility ordering via Voronoi diagrams.	Vis. Comput.	2007	DBLP DOI BibTeX RDF	Voronoi diagrams, Visibility determination, Visibility ordering, Space subdivision, Priority algorithm
23	William W. Hargrove, Forrest M. Hoffman, Paul F. Hessburg	Mapcurves: a quantitative method for comparing categorical maps.	J. Geogr. Syst.	2006	DBLP DOI BibTeX RDF	Ecoregion, Kappa statistic, Landcover, Spatial concordance, Spatial uncertainty, Vegetation, Model validation, Overlap, Goodness-of-fit
23	Michael Kortenjan, Gunnar Schomaker	Size equivalent cluster trees (SEC-Trees) realtime rendering of large industrial scenes.	Afrigraph	2006	DBLP DOI BibTeX RDF	clustering, spatial data structures, rendering systems, level of detail algorithms
23	Subramaniam Ganesan, Kenneth Ong	Mesh simplification using ellipsoidal schema for isotropic quantization of face-normal vectors.	APVIS	2006	DBLP DOI BibTeX RDF	ellipsoidal schema, isotropic quantization, mesh simplification, codebook
23	Xiaqing Wu, John K. Johnstone	Delaunay-Based Polygon Morphing Across a Change in Topology.	ICCSA (1)	2006	DBLP DOI BibTeX RDF
23	Yuan-Yu Tsai, Chung-Ming Wang, Chung-Hsien Chang, Yu-Ming Cheng	Tunable Bounding Volumes for Monte Carlo Applications.	ICCSA (1)	2006	DBLP DOI BibTeX RDF
23	Shinichi Fukushige, Hiromasa Suzuki	Voronoi diagram depth sorting for polygon visibility ordering.	GRAPHITE	2006	DBLP DOI BibTeX RDF	depth sorting, transparency rendering, Voronoi diagram, visibility determination
23	Takashi Terashima, Hiroshi Shimanuki, Jien Kato, Toyohide Watanabe	Method for Representing 3-D Virtual Origami.	ICDAR	2005	DBLP DOI BibTeX RDF
23	Daniel Méneveaux, Kadi Bouatouch, Gilles Subrenat, Philippe Blasi	Efficient clustering and visibility calculation for global illumination.	Afrigraph	2003	DBLP DOI BibTeX RDF	architectural environments, clustering, global illumination, visibility
23	Chris Joslin, Nadia Magnenat-Thalmann	Significant facet retrieval for real-time 3D sound rendering in complex virtual environments.	VRST	2003	DBLP DOI BibTeX RDF	sound rendering, virtual environments, scene segmentation, bounding-box
23	Jan Klein 0001, Gabriel Zachmann	Time-critical collision detection using an average-case approach.	VRST	2003	DBLP DOI BibTeX RDF	average-case algorithms, bounding volume trees, probabilistic analysis, virtual prototyping, hierarchical data structures, interference detection, hierarchical partitioning
23	Tong-Yee Lee, Ping-Hsien Lin, Tz-Hsien Yang	A Hybrid Scheme for Interactive Rendering a Virtual Environment.	ICCSA (3)	2003	DBLP DOI BibTeX RDF
23	Ross Brown 0001, Luke Cooper, Binh Pham 0001	Visual attention-based polygon level of detail management.	GRAPHITE	2003	DBLP DOI BibTeX RDF	level of detail management, visual attention, real-time graphics
23	Kenjiro T. Miura 0001, Hiroshi Masuda	Selective Non-Uniform Subdivision.	PG	2002	DBLP DOI BibTeX RDF
23	Jairo Rocha	Polygon Partition into Stable Regions.	DAGM-Symposium	2002	DBLP DOI BibTeX RDF
23	Steven A. Roberts, G. Brent Hall, Paul H. Calamai	Assessing polygon edge integrity.	J. Geogr. Syst.	2001	DBLP DOI BibTeX RDF
23	Alan Saalfeld	Area-preserving piecewise affine mappings.	SCG	2001	DBLP DOI BibTeX RDF	authalic transformations, piecewise affine homemorphisms
23	Yuefeng Zhang, Yu Huang	Wavelet shape blending.	Vis. Comput.	2000	DBLP DOI BibTeX RDF	Algorithm, Animation, Wavelet transform, Shape blending
23	Takayuki Itoh, Yasushi Yamaguchi 0001, Koji Koyamada	Fast Isosurface Generation Using the Cell-Edge Centered Propagation Algorithm.	ISHPC	2000	DBLP DOI BibTeX RDF
23	A. Schubert	Detection and Tracking of Facial Features in Real Time Using a Synergistic Approach of Spatio-Temporal Models and Generalized Hough-Transform Techniques.	FG	2000	DBLP DOI BibTeX RDF
23	Harlen Costa Batagelo, Ilaim Costa Júnior	Real-Time Shadow Generation Using BSP Trees and Stencil Buffers.	SIBGRAPI	1999	DBLP DOI BibTeX RDF	Stencil Buffers, Shadows, BSP Trees
23	Robert Babilon, Helena Nyklová, Ondrej Pangrác, Jan Vondrák	Visibility Representations of Complete Graphs.	GD	1999	DBLP DOI BibTeX RDF
23	Eric Rémila	Tiling Groups: New Applications in the Triangular Lattice.	Discret. Comput. Geom.	1998	DBLP DOI BibTeX RDF
23	Danny Z. Chen	Efficient Geometric Algorithms on the EREW PRAM.	IEEE Trans. Parallel Distributed Syst.	1995	DBLP DOI BibTeX RDF
23	Joseph S. B. Mitchell, Subhash Suri	Separation and Approximation of Polyhedral Objects.	SODA	1992	DBLP BibTeX RDF
23	Jean-Marc Robert 0001, Godfried T. Toussaint	Linear Approximation of Simple Objects.	STACS	1992	DBLP DOI BibTeX RDF