On separating two simple polygons by a single translation
From MaRDI portal
Recommendations
Cites work
- A linear algorithm for finding the convex hull of a simple polygon
- Erratum: An O(n\log \log n)-Time Algorithm for Triangulating a Simple Polygon
- Euclidean shortest paths in the presence of rectilinear barriers
- Geodesic methods in quantitative image analysis
- scientific article; zbMATH DE number 3838820 (Why is no real title available?)
- scientific article; zbMATH DE number 3905323 (Why is no real title available?)
- scientific article; zbMATH DE number 3945379 (Why is no real title available?)
- scientific article; zbMATH DE number 3945381 (Why is no real title available?)
- On Removing a Ball without Disturbing the Others
- Optimal Search in Planar Subdivisions
- Separating two simple polygons by a sequence of translations
- Shortest path solves edge-to-edge visibility in a polygon
- Traditional Galleries Require Fewer Watchmen
Cited in
(26)- Separating two simple polygons by a sequence of translations
- Computing minimum length paths of a given homotopy class
- Separability by two lines and by nearly straight polygonal chains
- Assembly sequences for polyhedra
- A polygonal approximation for general 4-contours corresponding to weakly simple curves
- Embedding graphs into embedded graphs
- On the separability of quadrilaterals in the plane by translations and rotations
- scientific article; zbMATH DE number 3905323 (Why is no real title available?)
- scientific article; zbMATH DE number 4049041 (Why is no real title available?)
- scientific article; zbMATH DE number 4051003 (Why is no real title available?)
- An optimal algorithm to translate a convex polyhedron through a two-dimensional convex window
- Intersection removal for simple polygons
- scientific article; zbMATH DE number 4121493 (Why is no real title available?)
- Relative convex hulls in semi-dynamic arrangements
- TRANSLATION QUERIES FOR SETS OF POLYGONS
- Translating polygons with applications to hidden surface removal
- Decomposing the boundary of a nonconvex polyhedron
- Separating translates in the plane: Combinatorial bounds and an algorithm
- Embedding Graphs into Embedded Graphs
- From curves to words and back again: geometric computation of minimum-area homotopy
- Separating a polyhedron by one translation from a set of obstacles
- Computing the minimal perimeter polygon for digital objects in the triangular tiling
- Decomposing the boundary of a nonconvex polyhedron
- Constant workspace algorithms for computing relative hulls in the plane
- Computing the minimal perimeter polygon for sets of rectangular tiles based on visibility cones
- An optimal algorithm for one-separation of a set of isothetic polygons
This page was built for publication: On separating two simple polygons by a single translation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1825657)
