Separating two simple polygons by a sequence of translations

From MaRDI portal
Revision as of 01:54, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1104080

DOI10.1007/BF02187902zbMath0646.68052OpenAlexW2049742898MaRDI QIDQ1104080

Micha Sharir, Shmuel Sifrony, Richard Pollack

Publication date: 1988

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131041




Related Items (29)

Arrangements of segments that share endpoints: Single face resultsAssembly sequences for polyhedraPlanar realizations of nonlinear Davenport-Schinzel sequences by segmentsTriangles in space or building (and analyzing) castles in the airCoordinated motion planning for two independent robotsOn the separability of quadrilaterals in the plane by translations and rotationsA survey of motion planning and related geometric algorithmsEnumerating Davenport-Schinzel sequencesOn the boundary of a union of RaysStoring line segments in partition treesSharp upper and lower bounds on the length of general Davenport-Schinzel sequencesAn optimal algorithm for the boundary of a cell in a union of raysThe upper envelope of piecewise linear functions: Algorithms and applicationsArrangements of curves in the plane --- topology, combinatorics, and algorithmsOn movable separability and isotheticityPartitioning a planar assembly into two connected parts is NP-completeThe number of edges of many faces in a line segment arrangementQuasi-optimal upper bounds for simplex range searching and new zone theoremsThe complexity and construction of many faces in arrangements of lines and of segmentsOn lazy randomized incremental constructionOn the general motion-planning problem with two degrees of freedomOn arrangements of Jordan arcs with three intersections per pairDetecting geometric infeasibilityOn separating two simple polygons by a single translationRobot motion planning and the single cell problem in arrangementsOn the zone of the boundary of a convex bodyOn the complexity of assembly partitioningOn the complexity of a single cell in certain arrangements of surfaces related to motion planningThe upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis




Cites Work




This page was built for publication: Separating two simple polygons by a sequence of translations