All-maximum and all-minimum problems under some measures
From MaRDI portal
Publication:396657
DOI10.1016/j.jda.2013.03.008zbMath1334.68262OpenAlexW1977150669MaRDI QIDQ396657
Satish Ch. Panigrahi, Asish Kumar Mukhopadhyay
Publication date: 13 August 2014
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2013.03.008
Applications of mathematical programming (90C90) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On ray shooting in convex polytopes
- On the all-farthest-segments problem for a planar set of points
- Farthest line segment Voronoi diagrams
- Selecting distances in arrangements of hyperplanes spanned by points.
- The power of geometric duality
- Topologically sweeping an arrangement
- A note on lower bounds for the maximum area and maximum perimeter k-gon problems
- 2-point site Voronoi diagrams
- A simple randomized sieve algorithm for the closest-pair problem
- On a class of \(O(n^ 2)\) problems in computational geometry
- An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points
- Proximity problems on line segments spanned by points
- Finding Extremal Polygons
- Constructing Arrangements of Lines and Hyperplanes with Applications
- On the Zone Theorem for Hyperplane Arrangements
