Generalization of Voronoi Diagrams in the Plane
From MaRDI portal
Publication:3902522
DOI10.1137/0210006zbMath0454.68083OpenAlexW2015751084MaRDI QIDQ3902522
No author found.
Publication date: 1981
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0210006
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)
Related Items (53)
2-point site Voronoi diagrams ⋮ Generalized Delaunay triangulation for planar graphs ⋮ Voronoi diagrams and arrangements ⋮ A parallel algorithm for computing Voronoi diagram of a set of circles using touching disc and topology matching ⋮ Voronoi diagrams over dynamic scenes ⋮ An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments ⋮ Farthest line segment Voronoi diagrams ⋮ An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points ⋮ Optical clustering ⋮ Clustering methods for geometric objects and applications to design problems ⋮ A sweepline algorithm for Voronoi diagrams ⋮ Simplified Voronoi diagrams ⋮ A straightforward algorithm for computing the medial axis of a simple polygon ⋮ EUCLIDEAN VORONOI DIAGRAM FOR CIRCLES IN A CIRCLE ⋮ The visibility-Voronoi complex and its applications ⋮ ON THE FARTHEST LINE-SEGMENT VORONOI DIAGRAM ⋮ Decomposing trimmed surfaces using the Voronoï diagram and a scan line algorithm ⋮ On fat partitioning, fat covering and the union size of polygons ⋮ On Clustering Induced Voronoi Diagrams ⋮ OPTIMAL VORONOI DIAGRAM CONSTRUCTION WITH n CONVEX SITES IN THREE DIMENSIONS ⋮ On \(O(n^2)\) heuristic algorithm for the directed Steiner minimal tree problem ⋮ Straight skeletons for general polygonal figures in the plane ⋮ Unnamed Item ⋮ Spanners of Additively Weighted Point Sets ⋮ Spanners of additively weighted point sets ⋮ An efficient algorithm for construction of the power diagram from the voronoi diagram in the plane ⋮ A dynamic sampling approach towards computing Voronoi diagram of a set of circles ⋮ Voronoi diagrams of polygons: a framework for shape representation. ⋮ Constructing the Voronoi diagram of a set of line segments in parallel ⋮ Duality of constrained Voronoi diagrams and Delaunay triangulations ⋮ Disk packing for the estimation of the size of a wire bundle ⋮ Voronoi diagram of a circle set from Voronoi diagram of a point set: I. Topology ⋮ Voronoi diagram of a circle set from Voronoi diagram of a point set: II. Geometry ⋮ VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments ⋮ COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS ⋮ Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces ⋮ Divide-and-conquer for Voronoi diagrams revisited ⋮ SKEW VORONOI DIAGRAMS ⋮ Conformal mapping in linear time ⋮ Near optimal minimal convex hulls of disks ⋮ Moving a disc between polygons ⋮ An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations ⋮ Robust Construction of the Additively-Weighted Voronoi Diagram via Topology-Oriented Incremental Algorithm ⋮ Bisectors of linearly separable sets ⋮ Voronoi diagrams with barriers and on polyhedra for minimal path planning ⋮ A unifying approach for a class of problems in the computational geometry of polygons ⋮ Multistage Robust Mixed-Integer Optimization with Adaptive Partitions ⋮ A transfinite form of Sibson's interpolant ⋮ Application of the theory of optimal set partitioning for constructing fuzzy Voronoi diagrams ⋮ Minimum vertex distance between separable convex polygons ⋮ Order-k Voronoi diagrams of sites with additive weights in the plane ⋮ The one-dimensional weighted Voronoi diagram ⋮ Topology-Oriented Incremental Algorithm for the Robust Construction of the Voronoi Diagrams of Disks
This page was built for publication: Generalization of Voronoi Diagrams in the Plane
