Proximity problems on line segments spanned by points

DOI10.1016/J.COMGEO.2005.08.007zbMATH Open1114.65018OpenAlexW1977633508MaRDI QIDQ2489537FDOQ2489537

Authors: Ovidiu Daescu, Jun Luo, David M. Mount 

Publication date: 28 April 2006

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2005.08.007

Recommendations

• Computing closest and farthest points for a query segment
• COMPUTING CLOSEST POINTS FOR SEGMENTS
• scientific article; zbMATH DE number 1424308
• Queries with segments in Voronoi diagrams
• scientific article; zbMATH DE number 1305399

zbMATH Keywords

algorithm

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Randomized optimal algorithm for slope selection
• A RANDOMIZED ALGORITHM FOR SLOPE SELECTION
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Optimal-Time Algorithm for Slope Selection
• Selecting distances in arrangements of hyperplanes spanned by points.
• Separating objects in the plane by wedges and strips
• Off-Line Maintenance of Planar Configurations
• Optimal slope selection via cuttings
• A tight bound for the number of different directions in three dimensions
• An Expander-Based Approach to Geometric Optimization
• ON ENUMERATING AND SELECTING DISTANCES
• Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses
• SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS
• Solution of Scott's problem on the number of directions determined by a point set in 3-space
• Farthest-Point Queries with Geometric and Combinatorial Constraints

Cited In (13)

• All-maximum and all-minimum problems under some measures
• Computing Euclidean Steiner trees over segments
• On the all-farthest-segments problem for a planar set of points
• Farthest line segment Voronoi diagrams
• Farthest segments and extremal triangles spanned by points in \(\mathbb R^3\)
• Computing closest and farthest points for a query segment
• An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points
• Extremal point queries with lines and line segments and related problems
• Multidimensional Lines II: Proximity and Applications
• COMPUTING CLOSEST POINTS FOR SEGMENTS
• Largest and smallest area triangles on imprecise points
• Optimal time bounds for some proximity problems in the plane
• Proximity on equilateral spaces

This page was built for publication: Proximity problems on line segments spanned by points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489537)