Separation and approximation of polyhedral objects

No abstract is available for this paper.

• Publication year

  1992

• Venue

  ACM-SIAM Symposium on Discrete Algorithms

• Publication date

  1992-09-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/0925-7721(95)00006-U
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Triangulating disjoint Jordan chains

  1994cited by this paper
• Approximating Polygons and Subdivisions with Minimum Link Paths

  1993cited by this paper
• Intersection detection and separators for simple polygons

  1992cited by this paper
• Approximating Polygons and Subdivisions with Minimum Link Paths

  1991cited by this paper
• Approximation schemes in computational geometry

  1990cited by this paper
• Covering convex sets with non-overlapping polygons

  1990cited by this paper
• Determining the Separation of Preprocessed Polyhedra - A Unified Approach

  1990cited by this paper
• Minimum Vertex Hulls for Polyhedral Domains

  1990cited by this paper
• Minimum Vertex Hulls for Polyhedral Domains

  1990cited by this paper
• On some link distance problems in a simple polygon

  1990cited by this paper
• On the complexity of polyhedral separability

  1988cited by this paper
• Algorithms in Combinatorial Geometry

  1987cited by this paper
• Finding the minimum visible vertex distance between two non-intersecting simple polygons

  1986influential reference
• On a Multidimensional Search Technique and its Application to the Euclidean One-Centre Problem

  1986cited by this paper
• Finding minimal convex nested polygons

  1985cited by this paper
• Linear Programming in Linear Time When the Dimension Is Fixed

  1984cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• An Efficient Simplex Coverability Algorithm in E2 with Application to Stochastic Sequential Machines

  1979cited by this paper
• Johnson: computers and intractability: a guide to the theory of np- completeness (freeman

  1979cited by this paper
• Finding the Intersection of two Convex Polyhedra

  1978cited by this paper
• On the ratio of optimal integral and fractional covers

  1975cited by this paper
• Approximation algorithms for combinatorial problems

  1973cited by this paper
• Approximation of Solutions of Mixed Boundary Value Problems for Poisson's Equation by Finite Differences

  1965cited by this paper
• Über den variabilitätsbereich der fourier’schen konstanten von positiven harmonischen funktionen

  1911cited by this paper

• A New Algorithm for Euclidean Shortest Paths in the Plane

  2023cites this paper
• Minimum Link Fencing

  2022cites this paper
• Computing Instance-Optimal Kernels in Two Dimensions

  2022cites this paper
• Graphical Models of Pandemic

  2021cites this paper
• A new algorithm for Euclidean shortest paths in the plane

  2021cites this paper
• Area-Optimal Simple Polygonalizations: The CG Challenge 2019

  2021cites this paper
• The Algorithm Design Manual

  2020cites this paper
• Approximate Polytope Membership Queries | SIAM Journal on Computing | Vol. 47, No. 1 | Society for Industrial and Applied Mathematics

  2018cites this paper
• Finding Small Hitting Sets in Infinite Range Spaces of Bounded VC-dimension

  2016cites this paper
• On the Combinatorial Complexity of Approximating Polytopes

  2016cites this paper
• An Optimal Algorithm for Minimum-Link 1 Rectilinear Paths in Rectilinear Domains

  2015cites this paper
• Reliable detection and separation of components for solid objects defined with scalar fields

  2015cites this paper
• An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains

  2015cites this paper
• Lower bounds for the number of hyperplanes separating two finite sets of points

  2015cites this paper
• Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation

  2014influential citation
• Stability and Complexity of Minimising Probabilistic Automata

  2014cites this paper
• Reliable Detection and Separation of Components for Solid Objects Defined with

  2014cites this paper
• Approximating Points by a Piecewise Linear Function

  2013cites this paper
• Polytope approximation and the Mahler volume

  2012cites this paper
• Approximate polytope membership queries

  2011cites this paper
• Approximation of Multiobjective Optimization Problems

  2011cites this paper
• Polytopic Approximation of Explicit Model Predictive Controllers

  2010cites this paper
• Contour trees and cross-sections of multiphase segmentations

  2009cites this paper
• Geometric approximations in 2- and 3-dimensional space (Geometrische Approximationen in 2- und 3-dimensionalen Räumen)

  2009cites this paper
• Convex piecewise-linear fitting

  2009cites this paper
• Approximating Points by a Piecewise Linear Function

  2009cites this paper
• Partial barrier coverage: Using game theory to optimize probability of undetected intrusion in polygonal environments

  2008cites this paper
• Barrier Coverage: Deploying Robot Guards to Prevent Intrusion

  2008cites this paper
• Succinct approximate convex pareto curves

  2008cites this paper
• The double description method for the approximation of explicit MPC control laws

  2008cites this paper
• Algorithms for Complex Shapes with Certified Numerics and Topology Spherical approximation of convex shapes

  2007cites this paper
• The Open Problems Project

  2007cites this paper
• Construction of Simplified Boundary Surfaces from Serial-sectioned Metal Micrographs

  2007influential citation
• Barrier Coverage for Variable Bounded-Range Line-of-Sight Guards

  2007cites this paper
• Approximation schemes for geometric problems

  2007cites this paper
• A space-optimal data-stream algorithm for coresets in the plane

  2007cites this paper
• Convex Approximation by Spherical Patches

  2007cites this paper
• CS-1996-19 E cient Algorithms for GeometricOptimizationPankaj

  2007cites this paper
• Application of Polytopic Separation Techniques to Nonlinear Observer Design

  2005cites this paper
• Improved Approximation Algorithms for Geometric Set Cover

  2005influential citation
• Approximate convex decomposition of polyhedra

  2004cites this paper
• VC-dimension of exterior visibility

  2004cites this paper
• FanGrower: A Simple Bi-resolution Triangle-mesh

  2003cites this paper
• Computational geometry

  2001cites this paper
• Optimal covering tours with turn costs

  2001cites this paper
• Approximation of Multiobjective Optimization Problems

  2001cites this paper
• Randomized Algorithms for Geometric Optimization Problems

  2001cites this paper
• Dealing with Shape Complexity for Internet Access and Graphic Applications

  2000cites this paper
• Link Distance Problems

  2000cites this paper
• Randomized Algorithms for GeometricOptimization Problems

  2000cites this paper
• On Simple Polygonalizations with Optimal Area

  2000influential citation
• Geometric Shortest Paths and Network Optimization

  2000cites this paper
• Discrete Geometric Shapes: Matching, Interpolation, and Approximation

  2000cites this paper
• Two-point Euclidean shortest path queries in the plane

  1999cites this paper
• Complexity and Approximation

  1999cites this paper
• A simple probablistic algorithm for approximating two and three-dimensional objects

  1999cites this paper
• E cient Algorithms for Geometric Optimization

  1998cites this paper
• Efficient algorithms for geometric optimization

  1998cites this paper
• An E cient Algorithm for Terrain Simpli cation

  1997cites this paper
• An efficient algorithm for terrain simplification

  1997cites this paper
• Simplification and Compression of 3D Scenes

  1997cites this paper
• Geometric simplification and compression

  1997cites this paper
• Simplification envelopes

  1996cites this paper
• Approximation algorithms for geometric problems

  1996cites this paper
• Computing Largest Circles Separating Two Sets of Segments

  1996cites this paper
• Controlled Topology Simplification

  1996cites this paper
• Efficient piecewise-linear function approximation using the uniform metric

  1995cites this paper
• Circular Separability of Polygons

  1995cites this paper
• Automatic generation of triangular irregular networks using greedy cuts

  1995cites this paper
• Almost optimal set covers in finite VC-dimension

  1995cites this paper
• Encoding shortest paths in spatial networks

  1995cites this paper
• A compendium of NP optimization problems

  1994cites this paper
• Almost optimal set covers in finite VC-dimension: (preliminary version)

  1994cites this paper
• Almost optimal polyhedral separators

  1994cites this paper
• Efficient piecewise-linear function approximation using the uniform metric: (preliminary version)

  1994cites this paper
• Algorithms for Polytope Covering and Approximation

  1993cites this paper
• Algorithms for Polytope Covering and Approximation, and for Approximate Closest-point Queries draft

  1993cites this paper
• Succinct Approximate Convex Pareto Curves ( Extended Abstract )

  year unknowncites this paper