Recommendations
- On the Farthest Line-Segment Voronoi Diagram
- On the farthest line-segment Voronoi diagram
- Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments
- Tight bound for farthest-color Voronoi diagrams of line segments
- Linear-time algorithms for the farthest-segment Voronoi diagram and related tree structures
Cites work
- scientific article; zbMATH DE number 732977 (Why is no real title available?)
- scientific article; zbMATH DE number 1424293 (Why is no real title available?)
- 2-point site Voronoi diagrams
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- A sweepline algorithm for Voronoi diagrams
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- Generalization of Voronoi Diagrams in the Plane
- On the all-farthest-segments problem for a planar set of points
- Proximity problems on line segments spanned by points
- Stabbing line segments
- Voronoui Diagrams in L₁ (L_\infty ) Metrics with 2-Dimensional Storage Applications
Cited in
(29)- Improved algorithms for the farthest colored Voronoi diagram of segments
- On the central path problem
- On farthest Voronoi cells
- All-maximum and all-minimum problems under some measures
- The higher-order Voronoi diagram of line segments
- Farthest-Point Queries with Geometric and Combinatorial Constraints
- Farthest-polygon Voronoi diagrams
- Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments
- Tight bound for farthest-color Voronoi diagrams of line segments
- Dispersing and grouping points on planar segments
- Farthest segments and extremal triangles spanned by points in \(\mathbb R^3\)
- Improved algorithms for farthest colored Voronoi diagram of segments
- Voronoi diagram for convex polygonal sites with convex polygon-offset distance function
- Stabbing circles for sets of segments in the plane
- Rearranging a sequence of points onto a line
- Euclidean farthest-point Voronoi diagram of a digital edge
- On the farthest line-segment Voronoi diagram
- On the Farthest Line-Segment Voronoi Diagram
- An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points
- The geodesic edge center of a simple polygon
- The Voronoi diagram of rotating rays with applications to floodlight illumination
- Unbounded regions of high-order Voronoi diagrams of lines and line segments in higher dimensions
- Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction
- Convex-straight-skeleton Voronoi diagrams for segments and convex polygons
- Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments
- A coreset for approximate furthest-neighbor queries in a simple polygon
- The farthest color Voronoi diagram in the plane
- Discrete and mixed two-center problems for line segments
- Linear-time algorithms for the farthest-segment Voronoi diagram and related tree structures
This page was built for publication: Farthest line segment Voronoi diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845871)
