Segments, rectangles, contours

DOI10.1016/0196-6774(81)90008-0MaRDI QIDQ3916031zbMATH OpenOpenAlexFDO

Authors Witold jun. Lipski, F. 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

zbMATH Keywords

computational geometrydata structuresoptimal algorithmsroute in a mazesegments of the planeVLSI design

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Cited in

(6)

• Interval graphs and related topics
• 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

This page was built for publication: Segments, rectangles, contours

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3916031)