A sweepline algorithm for Voronoi diagrams

Related Items

The L∞ Hausdorff Voronoi Diagram Revisited, An optimal algorithm for computing visible nearest foreign neighbors among colored line segments, IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION, A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects, Minimum weight euclidean matching and weighted relative neighborhood graphs, Computing the Implicit Voronoi Diagram in Triple Precision, DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES, Exact computation of the medial axis of a polyhedron, AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗, A Shape-Newton Approach to the Problem of Covering with Identical Balls, A plane-sweep algorithm for finding a closest pair among convex planar objects, “The big sweep”: On the power of the wavefront approach to Voronoi diagrams, Voronoi diagrams for polygon-offset distance functions, Computing constrained minimum-width annuli of point sets, OPTIMAL VORONOI DIAGRAM CONSTRUCTION WITH n CONVEX SITES IN THREE DIMENSIONS, An algorithmic framework for the single source shortest path problem with applications to disk graphs, Efficient computation of the geodesic Voronoi diagram of points in a simple polygon, An extension to \textsc{Voro++} for multithreaded computation of Voronoi cells, A mathematical framework for modeling axon guidance, Dynamic connectivity in disk graphs, Unnamed Item, Unnamed Item, The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs, Spanners of Additively Weighted Point Sets, Farthest-point Voronoi diagrams in the presence of rectangular obstacles, Voronoi diagrams in the moscow metric, BIARC APPROXIMATION, SIMPLIFICATION AND SMOOTHING OF POLYGONAL CURVES BY MEANS OF VORONOI-BASED TOLERANCE BANDS, Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function, Unnamed Item, Unnamed Item, Voronoi diagram with visual restriction, Unnamed Item, An efficient algorithm for construction of the power diagram from the voronoi diagram in the plane, Dilation-Optimal Edge Deletion in Polygonal Cycles, Multiscale Methods for Data on Graphs and Irregular Multidimensional Situations, Optimal image quantization, perception and the median cut algorithm, Interval arithmetic yields efficient dynamic filters for computational geometry, Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D, A comparison of sequential Delaunay triangulation algorithms., Voronoi diagrams for convex polygon-offset distance functions, A variational meshfree method for solving time-discrete diffusion equations, 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, THE L_∞ VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS, SKEW VORONOI DIAGRAMS, The natural element method in solid mechanics, Efficient Node Overlap Removal Using a Proximity Stress Model, Computing shortest heterochromatic monotone routes, Intersecting disks using two congruent disks, Fuzzy Voronoi Diagram, A simple quality triangulation algorithm for complex geometries, Robust Construction of the Additively-Weighted Voronoi Diagram via Topology-Oriented Incremental Algorithm, Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs., A High Order Stable Conservative Method for Solving Hyperbolic Conservation Laws on Arbitrarily Distributed Point Clouds, Voronoi Diagrams and Their Uses, Map of Geometric Minimal Cuts for General Planar Embedding, Topology-Oriented Incremental Algorithm for the Robust Construction of the Voronoi Diagrams of Disks, Between shapes, using the Hausdorff distance, Point placement algorithms for Delaunay triangulation of polygonal domains, Abstract Voronoi diagram in 3-space, ``The big sweep: On the power of the wavefront approach to Voronoi diagrams, Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\), An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments, Distance-sensitive planar point location, Edge insertion for optimal triangulations, Reverse shortest path problem for unit-disk graphs, Algorithms for graphs of bounded treewidth via orthogonal range searching, Local calculation of Voronoi diagrams, Representation of segment Voronoi diagram by Bézier curves, Sequent reconstruction in LLM -- A sweepline proof, Using geometry to solve the transportation problem in the plane, Farthest line segment Voronoi diagrams, Approximate single linkage cluster analysis of large data sets in high-dimensional spaces, Sorting helps for Voronoi diagrams, Finding a closet visible vertex pair between two polygons, Reverse shortest path problem in weighted unit-disk graphs, Fast computing of three-dimensional convex hulls using graphics hardware, Linear-size nonobtuse triangulation of polygons, A compact piecewise-linear Voronoi diagram for convex sites in the plane, FastJet user manual (for version 3.0.2), Randomized incremental construction of simple abstract Voronoi diagrams in 3-space, Voronoi diagrams on orbifolds, Constrained Delaunay triangulations, On the geodesic Voronoi diagram of point sites in a simple polygon, Voronoi-like partition of lattice in cellular automata, Shortest monotone descent path problem in polyhedral terrain, A generalized finite difference method using Coatmèlec lattices, An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\), Approximate matching of polygonal shapes, Perturbations for Delaunay and weighted Delaunay 3D triangulations, The Zermelo-Voronoi diagram: a dynamic partition problem, Constructing Voronoi diagrams from hollow spheres using conformal geometric algebra, A faster circle-sweep Delaunay triangulation algorithm, Mutual exclusion in MANETs using quorum agreements, Farthest-polygon Voronoi diagrams, 2D automatic body-fitted structured mesh generation using advancing extraction method, Modeling the effects of vasculature evolution on early brain tumor growth, Spanners of additively weighted point sets, Remarks on the computation of the horizon of a digital terrain, Finite element network approximation of conductivity in particle composites, An optimal algorithm for constructing oriented Voronoi diagrams and geograph neighborhood graphs, Fixed-radius near neighbors search algorithms for points and segments, Combinatorial complexity bounds for arrangements of curves and spheres, On maximum flows in polyhedral domains, The saga of minimum spanning trees, Near-optimal algorithms for shortest paths in weighted unit-disk graphs, Computing the map of geometric minimal cuts, Application of NEM in seepage analysis with a free surface, Adaptive least-squares finite element approximations to Stokes equations, Fixed-radius near neighbors search, Randomized incremental construction of Delaunay and Voronoi diagrams, Searching for segments with largest relative overlap, The legacy of automatic mesh generation from solid modeling, \(L_ 1\) shortest paths among polygonal obstacles in the plane, A convex hull algorithm for discs, and applications, Solving continuous location-districting problems with Voronoi diagrams, An isotropic unstructured mesh generation method based on a fluid relaxation analogy, An upper bound for conforming Delaunay triangulations, Randomized incremental construction of abstract Voronoi diagrams, A convex polygon among polygonal obstacle: Placement and high-clearance motion, Fully dynamic Delaunay triangulation in logarithmic expected per operation, A new parallel algorithm for constructing Voronoi tessellations from distributed input data, Voronoi diagrams of polygons: a framework for shape representation., An all-round sweep algorithm for 2-dimensional nearest-neighbor problems, A new clustering algorithm for coordinate-free data, Constructing the Voronoi diagram of a set of line segments in parallel, Duality of constrained Voronoi diagrams and Delaunay triangulations, On the randomized construction of the Delaunay tree, Optimal adaptive grids of least-squares finite element methods in two spatial dimensions, The directed Hausdorff distance between imprecise point sets, On the restricted 1-Steiner tree problem, Uncertain Voronoi diagram, Divide-and-conquer for Voronoi diagrams revisited, Convex-straight-skeleton Voronoi diagrams for segments and convex polygons, A second-order accurate material-order-independent interface reconstruction technique for multi-material flow simulations, Voronoi diagrams for a moderate-sized point-set in a simple polygon, Voronoi diagram for services neighboring a highway, Oracle complexities for computional geometry of semi-algebraic sets and voronoi diagrams, Adaboost-based ensemble of polynomial chaos expansion with adaptive sampling, A nearly optimal deterministic parallel Voronoi diagram algorithm, On the construction of abstract Voronoi diagrams, Single facility collection depots location problem in the plane, Vehicle routing with a sparse feasibility graph, There are planar graphs almost as good as the complete graph, Numerical construction of optimal adaptive grids in two spatial dimensions, The transportation metric and related problems, Robustness of \(k\)-gon Voronoi diagram construction, Efficient minimum spanning tree construction with Delaynay triangulation, Tropical bisectors and Voronoi diagrams, Melting, pinning and forced flow of magnetic bubble arrays, Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae, Voronoi diagrams on the sphere, Optimal computation of the Voronoi diagram of disjoint clusters, Experimental results on quadrangulations of sets of fixed points, A workbench for computational geometry, Fast segment insertion and incremental construction of constrained Delaunay triangulations, On soft predicates in subdivision motion planning

Cites Work