Extremal point queries with lines and line segments and related problems
From MaRDI portal
Publication:2571215
DOI10.1016/j.comgeo.2005.03.002zbMath1082.65019OpenAlexW2033872228MaRDI QIDQ2571215
Ovidiu Daescu, Robert J. Serfling
Publication date: 1 November 2005
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2005.03.002
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Range searching with efficient hierarchical cuttings
- On ray shooting in convex polytopes
- An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons
- The power of geometric duality revisited
- Reporting points in halfspaces
- Efficient partition trees
- Line transversals of balls and smallest enclosing cylinders in three dimensions
- On range searching with semialgebraic sets
- Queries with segments in Voronoi diagrams
- Efficiently approximating polygonal paths in three and higher dimensions
- High-dimensional shape fitting in linear time
- Efficient algorithms for approximating polygonal chains
- Approximating extent measures of points
- Efficiently computing the closest point to a query line
- Space-Time Tradeoffs for Emptiness Queries
- Shape Fitting with Outliers
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
- SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE
- APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
- Exact and approximation algorithms for minimum-width cylindrical shells
This page was built for publication: Extremal point queries with lines and line segments and related problems
