scientific article; zbMATH DE number 4149525
zbMATH Open0701.68004MaRDI QIDQ3479508FDOQ3479508
Authors:
Publication date: 1987
Title of this publication is not available (Why is that?)
Recommendations
modellingplanningdecompositioncomputational geometrytriangulationconvex hullpolygonsretractionroboticsgeometric transformationRoboticshierarchical searchGeometric aspectsAlgorithmic aspectscollision-free motions
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02) Convex sets without dimension restrictions (aspects of convex geometry) (52A05)
Cited In (21)
- Rods and Rings: Soft Subdivision Planner for R^3 x S^2.
- A competitive analysis of algorithms for searching unknown scenes
- Title not available (Why is that?)
- The visibility diagram: A data structure for visibility problems and motion planning
- An approximate algorithm for computing multidimensional convex hulls
- An algorithmic approach to some problems in terrain navigation
- Mapping in unknown graph-like worlds
- Finding a largest rectangle inside a digital object and rectangularization
- Combinatorial complexity of translating a box in polyhedral 3-space
- Soft subdivision search in motion planning. II: Axiomatics
- The complexity of the free space for a robot moving amidst fat obstacles
- Title not available (Why is that?)
- On soft predicates in subdivision motion planning
- Algorithmic and geometric aspects of robotics
- On the reconfiguration of chains
- Algorithmic foundations of robotics VI (WAFR 2004). Sixth international workshop on algorithmic foundations of robotics, Utrecht/Zeist, The Netherlands, July 11-13, 2004.
- Computational geometry in a curved world
- The topology of boundaries
- Simultaneous inner and outer approximation of shapes
- Characterizing the shortest path of an object among obstacles
- A note on the combinatorial structure of the visibility graph in simple polygons
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3479508)