Publication:4945513
From MaRDI portal
zbMath0953.68138MaRDI QIDQ4945513
Jörg-Rüdiger Sack, Hristo N. Djidjev, Anil Maheshwari
Publication date: 23 March 2000
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
Related Items
Euclidean Steiner Spanners: Light and Sparse, Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons, A Census of Plane Graphs with Polyline Edges, Traversing a set of points with a minimum number of turns, Cutting polygons into small pieces with chords: Laser-based localization, Diffuse reflection diameter in simple polygons, On \(k\)-convex polygons, Link distance and shortest path problems in the plane, An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions, An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains, Settling the bound on the rectilinear link radius of a simple rectilinear polygon, Combining discrete and continuous optimization to solve kinodynamic motion planning problems, Diffuse reflection diameter and radius for convex-quadrilateralizable polygons, On the polygonal diameter (= link diameter) of the interior, resp. exterior, of a simple closed polygon in the plane, Minimum-link paths revisited, Link Distance and Shortest Path Problems in the Plane
