A linear-time algorithm for computing the Voronoi diagram of a convex polygon
From MaRDI portal
(Redirected from Publication:911267)
Recommendations
- scientific article; zbMATH DE number 4051001
- A nearly parallel algorithm for the Voronoi diagram of a convex polygon
- A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
- scientific article; zbMATH DE number 177538
- A LINEAR-TIME RANDOMIZED ALGORITHM FOR THE BOUNDED VORONOI DIAGRAM OF A SIMPLE POLYGON
Cites work
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 3562002 (Why is no real title available?)
- A linear algorithm for finding the convex hull of a simple polygon
- Generalized Delaunay triangulation for planar graphs
- On k-Nearest Neighbor Voronoi Diagrams in the Plane
- Optimal Search in Planar Subdivisions
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
Cited in
(only showing first 100 items - show all)- Selection and sorting in totally monotone arrays
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
- scientific article; zbMATH DE number 2036224 (Why is no real title available?)
- On selecting a fraction of leaves with disjoint neighborhoods in a plane tree
- Fast greedy triangulation algorithms.
- Resolving Loads with Positive Interior Stresses
- An O(log log n) algorithm to compute the kernel of a polygon
- Deletion in Abstract Voronoi Diagrams in Expected Linear Time.
- On the line-separable unit-disk coverage and related problems
- OPTIMAL VORONOI DIAGRAM CONSTRUCTION WITH n CONVEX SITES IN THREE DIMENSIONS
- scientific article; zbMATH DE number 7765386 (Why is no real title available?)
- Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem
- Linear algorithm to find the largest intriangles of a planar convex polygon
- Collision detection algorithm of a continuous type using spherical extreme vertex diagrams
- An optimal algorithm for roundness determination on convex polygons
- A linear-time construction of the relative neighborhood graph within a histogram
- Cohesive zone representation and junction partitioning for crystal plasticity analyses
- Dilation-optimal edge deletion in polygonal cycles
- An optimal and practical algorithm for the planar 2-center problem
- Forest-like abstract Voronoi diagrams in linear time
- Minimizing the diameter of a spanning tree for imprecise points
- Reprint of: Weighted straight skeletons in the plane
- An approximation algorithm for locating maximal disks within convex polygons
- Deletion in abstract Voronoi diagrams in expected linear time and related problems
- Assigning weights to minimize the covering radius in the plane
- scientific article; zbMATH DE number 753970 (Why is no real title available?)
- Vector-Based Morphological Operations on Polygons Using Straight Skeletons for Digital Pathology
- A SIMPLE FACTOR-2/3 APPROXIMATION ALGORITHM FOR TWO-CIRCLE POINT LABELING
- Abstract Voronoi diagrams revisited
- Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time
- A fast straight-skeleton algorithm based on generalized motorcycle graphs
- Algorithms for proximity problems in higher dimensions
- Farthest line segment Voronoi diagrams
- A simple algorithm for higher-order Delaunay mosaics and alpha shapes
- Voronoi Diagrams of Moving Points
- Applications of generalized matrix searching to geometric algorithms
- Constrained minimum enclosing circle with center on a query line segment
- Two-floodlight illumination of convex polygons
- Compressing spatio-temporal trajectories
- Base station placement on boundary of a convex polygon
- Delaunay triangulation of imprecise points in linear time after preprocessing
- Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time
- Weighted straight skeletons in the plane
- A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis
- Analytical computation of arc menisci configuration under primary drainage in convex capillary cross sections
- Fast algorithms for greedy triangulation
- Reachability by paths of bounded curvature in a convex polygon
- Finding the medial axis of a simple polygon in linear time
- An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments
- Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings
- Star-unfolding polygons
- Conformal mapping in linear time
- Isoperimetric enclosures
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- ON DELETION IN DELAUNAY TRIANGULATIONS
- Voronoi diagrams of moving points in higher dimensional spaces
- Minimizing the sum of diameters efficiently
- Rapid and accurate computation of the distance function using grids
- On the farthest line-segment Voronoi diagram
- A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
- Packing two disks in a polygon
- An optimal algorithm for roundness determination on convex polygons
- Vertex removal in two-dimensional Delaunay triangulation: speed-up by low degrees optimization
- Maintaining the minimal distance of a point set in polylogarithmic time
- Farthest-point queries with geometric and combinatorial constraints
- Recognizing Voronoi Diagrams with Linear Programming
- THE DELAUNAY HIERARCHY
- The \(k\)-nearest-neighbor Voronoi diagram revisited
- Covering convex polygons by two congruent disks
- Bumpy pyramid folding
- Efficiently updating constrained Delaunay triangulations
- Spanning trees in multipartite geometric graphs
- Computing convex-straight-skeleton Voronoi diagrams for segments and convex polygons
- IMMOBILIZING A SHAPE
- scientific article; zbMATH DE number 3945378 (Why is no real title available?)
- Computing hereditary convex structures
- Efficient splitting and merging algorithms for order decomposable problems.
- Optimizing a constrained convex polygonal annulus
- Placing two disks in a convex polygon
- Hamiltonian triangulations and circumscribing polygons of disjoint line segments
- Voronoi-like partition of lattice in cellular automata
- On computing the optimal bridge between two convex polygons.
- On optimal bridges between two convex regions
- Finding the \(k\) smallest spanning trees
- Efficient splitting and merging algorithms for order decomposable problems
- An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments (extended abstract)
- Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements
- A linear algorithm for determining the separation of convex polyhedra
- Computing farthest neighbors on a convex polytope.
- Farthest-point Voronoi diagrams in the presence of rectangular obstacles
- A linear-time construction of Reuleaux polygons
- The higher-order Voronoi diagram of line segments
- Weighted skeletons and fixed-share decomposition
- A simple algorithm for computing the smallest enclosing circle
- The geodesic farthest-point Voronoi diagram in a simple polygon
- Computing the intersection-depth to polyhedra
- Computing the shortest diagonal of a monotone polygon in linear time
- VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments
- Fast algorithms for greedy triangulation
- Fully dynamic Delaunay triangulation in logarithmic expected per operation
This page was built for publication: A linear-time algorithm for computing the Voronoi diagram of a convex polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911267)
