Separation and approximation of polyhedral objects
From MaRDI portal
Publication:1900992
DOI10.1016/0925-7721(95)00006-UzbMath0831.68113MaRDI QIDQ1900992
Subhash Suri, Joseph S. B. Mitchell
Publication date: 13 February 1996
Published in: Computational Geometry (Search for Journal in Brave)
Related Items
Approximating points by a piecewise linear function ⋮ Area-Optimal Simple Polygonalizations: The CG Challenge 2019 ⋮ On the combinatorial complexity of approximating polytopes ⋮ Approximate Polytope Membership Queries ⋮ Lower bounds for the number of hyperplanes separating two finite sets of points ⋮ An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains ⋮ COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Covering convex sets with non-overlapping polygons
- Minimum polygonal separation
- On the complexity of polyhedral separability
- Minimum vertex hulls for polyhedral domains
- Approximation algorithms for combinatorial problems
- On the ratio of optimal integral and fractional covers
- Finding the intersection of two convex polyhedra
- Finding minimal convex nested polygons
- Linear Programming in Linear Time When the Dimension Is Fixed
- An Efficient Simplex Coverability Algorithm in E2 with Application to Stochastic Sequential Machines
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
- TRIANGULATING DISJOINT JORDAN CHAINS
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
