Segments, rectangles, contours
From MaRDI portal
Publication:3916031
DOI10.1016/0196-6774(81)90008-0zbMath0464.68073OpenAlexW2011774530MaRDI QIDQ3916031
Witold jun. Lipski, Franco P. Preparata
Publication date: 1981
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2142/74221
VLSI designdata structurescomputational geometryoptimal algorithmsroute in a mazesegments of the plane
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)
Related Items (6)
Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape ⋮ Algorithmic and complexity issues of robot motion in an uncertain environment ⋮ Parallel computational geometry ⋮ A space-optimal solution of general region location ⋮ INTERSECTION PROBLEMS ON SEGMENTS UNDER BOUNDARY UPDATES WITH APPLICATION TO PERSISTENT LISTS ⋮ Interval graphs and related topics
This page was built for publication: Segments, rectangles, contours
