Generalized Voronoi diagrams for a ladder: II. Efficient construction of the diagram

No abstract is available for this paper.

• Publication year

  2018

• Venue

  Algorithmica

• Publication date

  2018-02-07

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/BF01840348
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Almost linear upper bounds on the length of general davenport—schinzel sequences

  1987cited by this paper
• AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments

  1987cited by this paper
• Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes

  1986cited by this paper
• A "Retraction" Method for Planning the Motion of a Disc

  1985cited by this paper
• Retraction: A new approach to motion-planning

  1983cited by this paper
• On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds

  1983cited by this paper
• Dynamic computational geometry

  1983cited by this paper
• On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers

  1983cited by this paper
• Solving the find-path problem by good representation of free space

  1982cited by this paper
• Efficient computation of continuous skeletons

  1979cited by this paper
• On a problem of Davenport and Schinzel

  1974cited by this paper
• A combinatorial problem connected with differential equations II

  1971cited by this paper
• A Combinatorial Problem Connected with Differential Equations

  1965cited by this paper

• Intelligent traffic analysis: A heuristic high-dimensional image search algorithm based on spatiotemporal probability for constrained environments

  2020cites this paper
• 50 ALGORITHMIC MOTION PLANNING

  2016cites this paper
• ALGORITHMIC MOTION PLANNING

  2016cites this paper
• Sharp Upper and Lower Bounds on the Length of General Davenport-Schinzel Sequences

  2015cites this paper
• On-line motion planning: Case of a planar rod

  2015cites this paper
• On soft predicates in subdivision motion planning

  2013cites this paper
• Motion Planning and Related Geometric Algorithms in Robotics

  2010cites this paper
• Hierarchical graphs as organisational principle and spatial model applied to pedestrian indoor navigation

  2009cites this paper
• Construction of the segment Delaunay triangulation by a flip algorithm (Construction de la triangulation de Delaunay de segments par un algorithme de flip)

  2008cites this paper
• Pianos are not flat: rigid motion planning in three dimensions

  2005cites this paper
• Motion Amidst Polygonal Obstacles *

  2005cites this paper
• Accurate sampling-based algorithms for surface extraction and motion planning

  2005cites this paper
• Minimizing the endpoint trace length of rod motions amidst polygonal obstacles is NP-hard

  2003cites this paper
• Voronoi diagrams of semi-algebraic sets

  2003cites this paper
• A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space

  1987cites this paper