scientific article; zbMATH DE number 742976
From MaRDI portal
Publication:4763415
Recommendations
- Separation and approximation of polyhedral objects
- scientific article; zbMATH DE number 5066290
- scientific article; zbMATH DE number 177829
- Polyhedral approximation of smooth convex bodies
- Separation via polyhedral conic functions
- Approximate convex decomposition of polyhedra and its applications
- A linear algorithm for determining the separation of convex polyhedra
- Polyhedral approaches
- scientific article; zbMATH DE number 895293
- Approximate convex decomposition of polygons
Cited in
(31)- On the complexity of polyhedral separability
- Minimum vertex hulls for polyhedral domains
- On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
- Exact separation of k-projection polytope constraints
- Separation and approximation of polyhedral objects
- Efficient piecewise-linear function approximation using the uniform metric
- Almost optimal set covers in finite VC-dimension
- Geometric multicut: shortest fences for separating groups of objects in the plane
- On the shortest separating cycle
- The complexity of separating points in the plane
- On the problem polyhedral separability: a numerical solution
- Dissection with the fewest pieces is hard, even to approximate
- Counterexample-Guided Refinement of Template Polyhedra
- A linear algorithm for determining the separation of convex polyhedra
- Convex piecewise-linear fitting
- Lifting and separation procedures for the cut polytope
- scientific article; zbMATH DE number 177829 (Why is no real title available?)
- Surface Approximation and Geometric Partitions
- The complexity of computing minimum separating polygons
- Encoding shortest paths in spatial networks
- On the complexity of approximating and illuminating three-dimensional convex polyhedra
- Algorithms for polytope covering and approximation
- Geometric multicut
- scientific article; zbMATH DE number 5066290 (Why is no real title available?)
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
- A Separation Algorithm for b-Matching Degree-Sequence Polyhedra
- Computational Science and Its Applications – ICCSA 2004
- An efficient abstract domain for not necessarily closed polyhedra
- Partitioning a planar assembly into two connected parts is NP-complete
- Polynomial-time algorithms for contiguous art gallery and related problems
- Structured discrete shape approximation: theoretical complexity and practical algorithm
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4763415)
