Pages that link to "Item:Q911267"
From MaRDI portal
The following pages link to A linear-time algorithm for computing the Voronoi diagram of a convex polygon (Q911267):
Displaying 50 items.
- The higher-order Voronoi diagram of line segments (Q261375) (← links)
- An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments (Q283875) (← links)
- Reachability by paths of bounded curvature in a convex polygon (Q425619) (← links)
- Base station placement on boundary of a convex polygon (Q436692) (← links)
- Computing hereditary convex structures (Q540446) (← links)
- Vertex removal in two-dimensional Delaunay triangulation: speed-up by low degrees optimization (Q617545) (← links)
- Efficiently updating constrained Delaunay triangulations (Q688628) (← links)
- A simple algorithm for computing the smallest enclosing circle (Q750173) (← links)
- Compressing spatio-temporal trajectories (Q833705) (← links)
- Abstract Voronoi diagrams revisited (Q833716) (← links)
- Farthest line segment Voronoi diagrams (Q845871) (← links)
- Applications of generalized matrix searching to geometric algorithms (Q913505) (← links)
- Constrained minimum enclosing circle with center on a query line segment (Q924081) (← links)
- Delaunay triangulation of imprecise points in linear time after preprocessing (Q1037646) (← links)
- Maintaining the minimal distance of a point set in polylogarithmic time (Q1189290) (← links)
- Finding the \(k\) smallest spanning trees (Q1196455) (← links)
- Fast algorithms for greedy triangulation (Q1196458) (← links)
- Computing the shortest diagonal of a monotone polygon in linear time (Q1198084) (← links)
- Fully dynamic Delaunay triangulation in logarithmic expected per operation (Q1199828) (← links)
- Minimizing the sum of diameters efficiently (Q1199831) (← links)
- Hamiltonian triangulations and circumscribing polygons of disjoint line segments (Q1200910) (← links)
- Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements (Q1317487) (← links)
- Computing farthest neighbors on a convex polytope. (Q1401257) (← links)
- Placing two disks in a convex polygon (Q1583047) (← links)
- Rapid and accurate computation of the distance function using grids (Q1601551) (← links)
- On computing the optimal bridge between two convex polygons. (Q1603485) (← links)
- On optimal bridges between two convex regions (Q1607067) (← links)
- Packing two disks in a polygon (Q1614067) (← links)
- Bumpy pyramid folding (Q1615921) (← links)
- Forest-like abstract Voronoi diagrams in linear time (Q1699286) (← links)
- Minimizing the diameter of a spanning tree for imprecise points (Q1709600) (← links)
- Spanning trees in multipartite geometric graphs (Q1755734) (← links)
- Data structures for halfplane proximity queries and incremental Voronoi diagrams (Q1755746) (← links)
- Collision detection algorithm of a continuous type using spherical extreme vertex diagrams (Q1767855) (← links)
- Optimizing a constrained convex polygonal annulus (Q1775012) (← links)
- Computing convex-straight-skeleton Voronoi diagrams for segments and convex polygons (Q1790962) (← links)
- Efficient splitting and merging algorithms for order decomposable problems. (Q1854311) (← links)
- A compact piecewise-linear Voronoi diagram for convex sites in the plane (Q1907612) (← links)
- Voronoi-like partition of lattice in cellular automata (Q1914936) (← links)
- An optimal algorithm for roundness determination on convex polygons (Q1917034) (← links)
- Algorithms for proximity problems in higher dimensions (Q1917037) (← links)
- Three-dimensional convex hull as a fruitful source of diagrams (Q1978717) (← links)
- On selecting a fraction of leaves with disjoint neighborhoods in a plane tree (Q2161244) (← links)
- Weighted straight skeletons in the plane (Q2261581) (← links)
- Analytical computation of arc menisci configuration under primary drainage in convex capillary cross sections (Q2269068) (← links)
- The geodesic farthest-point Voronoi diagram in a simple polygon (Q2309478) (← links)
- Assigning weights to minimize the covering radius in the plane (Q2331208) (← links)
- Reprint of: Weighted straight skeletons in the plane (Q2341696) (← links)
- Isoperimetric enclosures (Q2345509) (← links)
- The \(k\)-nearest-neighbor Voronoi diagram revisited (Q2346966) (← links)
