Separation and approximation of polyhedral objects

DOI10.1016/0925-7721(95)00006-UzbMATH Open0831.68113MaRDI QIDQ1900992FDOQ1900992

Subhash Suri, Joseph S. B. Mitchell

Publication date: 13 February 1996

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

zbMATH Keywords

facet-complexitynested convex polyhedral

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximation algorithms for combinatorial problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the ratio of optimal integral and fractional covers
• Title not available (Why is that?)
• On the complexity of polyhedral separability
• Linear Programming in Linear Time When the Dimension Is Fixed
• APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
• Title not available (Why is that?)
• On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
• Finding the intersection of two convex polyhedra
• TRIANGULATING DISJOINT JORDAN CHAINS
• Covering convex sets with non-overlapping polygons
• Minimum polygonal separation
• Minimum vertex hulls for polyhedral domains
• Finding minimal convex nested polygons
• An Efficient Simplex Coverability Algorithm in E2 with Application to Stochastic Sequential Machines

Cited In (21)

• Area-Optimal Simple Polygonalizations: The CG Challenge 2019
• A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces
• Lifting and separation procedures for the cut polytope
• Approximate Polytope Membership Queries
• COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the problem polyhedral separability: a numerical solution
• Title not available (Why is that?)
• Separation via polyhedral conic functions
• Approximating points by a piecewise linear function
• An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains
• Fast polyhedra abstract domain
• Counterexample-Guided Refinement of Template Polyhedra
• On the combinatorial complexity of approximating polytopes
• SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
• Lower bounds for the number of hyperplanes separating two finite sets of points
• Exact separation of \(k\)-projection polytope constraints
• An efficient abstract domain for not necessarily closed polyhedra
• A linear algorithm for determining the separation of convex polyhedra
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• On the complexity of polyhedral separability 👍 👎
• Minimum polygonal separation 👍 👎
• A linear algorithm for determining the separation of convex polyhedra 👍 👎
• Title not available (Why is that?) 👍 👎

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)