Separation and approximation of polyhedral objects
From MaRDI portal
Publication:1900992
Recommendations
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 177829 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
- An Efficient Simplex Coverability Algorithm in E2 with Application to Stochastic Sequential Machines
- Approximation algorithms for combinatorial problems
- Covering convex sets with non-overlapping polygons
- Finding minimal convex nested polygons
- Finding the intersection of two convex polyhedra
- Linear Programming in Linear Time When the Dimension Is Fixed
- Minimum polygonal separation
- Minimum vertex hulls for polyhedral domains
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
- On the complexity of polyhedral separability
- On the ratio of optimal integral and fractional covers
- TRIANGULATING DISJOINT JORDAN CHAINS
Cited in
(28)- Approximate polytope membership queries
- On the problem polyhedral separability: a numerical solution
- Lower bounds for the number of hyperplanes separating two finite sets of points
- A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces
- Polytope approximation and the Mahler volume
- On the shortest separating cycle
- Exact separation of \(k\)-projection polytope constraints
- Separating a polyhedron by one translation from a set of obstacles
- Minimum polygonal separation
- Structured discrete shape approximation: theoretical complexity and practical algorithm
- Area-optimal simple polygonalizations: the CG challenge 2019
- Geometric multicut: shortest fences for separating groups of objects in the plane
- The complexity of separating points in the plane
- Lifting and separation procedures for the cut polytope
- On the combinatorial complexity of approximating polytopes
- scientific article; zbMATH DE number 177829 (Why is no real title available?)
- scientific article; zbMATH DE number 742976 (Why is no real title available?)
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
- scientific article; zbMATH DE number 5066290 (Why is no real title available?)
- Separation via polyhedral conic functions
- Fast polyhedra abstract domain
- Computational Science and Its Applications – ICCSA 2004
- COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS
- A linear algorithm for determining the separation of convex polyhedra
- Approximation schemes for partitioning: convex decomposition and surface approximation
- Counterexample-Guided Refinement of Template Polyhedra
- An efficient abstract domain for not necessarily closed polyhedra
- Approximating points by a piecewise linear function
This page was built for publication: Separation and approximation of polyhedral objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900992)
