Fast triangulation of the plane with respect to simple polygons
From MaRDI portal
Publication:3694693
DOI10.1016/S0019-9958(85)80044-9zbMath0575.68049MaRDI QIDQ3694693
Publication date: 1985
Published in: Information and Control (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Polyhedra and polytopes; regular figures, division of spaces (51M20)
Related Items (5)
Planar and Toroidal Morphs Made Easier ⋮ ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS ⋮ Computing \(L_1\) shortest paths among polygonal obstacles in the plane ⋮ Shortest path planning for a tethered robot ⋮ COMPUTATIONAL AND STRUCTURAL ADVANTAGES OF CIRCULAR BOUNDARY REPRESENTATION
This page was built for publication: Fast triangulation of the plane with respect to simple polygons