Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
From MaRDI portal
Publication:3128986
DOI10.1006/jagm.1995.0797zbMath0866.68117MaRDI QIDQ3128986
Publication date: 27 April 1997
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/52d1690ef4d137357455efb472a2c4aae6d00564
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS, A faster algorithm for computing motorcycle graphs, Relative convex hulls in semi-dynamic arrangements, Augmenting the edge connectivity of planar straight line graphs to three, Pointed binary encompassing trees: simple and optimal, Decomposing a simple polygon into pseudo-triangles and convex polygons, Highway hull revisited, Tight degree bounds for pseudo-triangulations of points, An algorithmic study of manufacturing paperclips and other folded structures., Minimum weight pseudo-triangulations, Decompositions, partitions, and coverings with convex polygons and pseudo-triangles, On the number of pseudo-triangulations of certain point sets