DOI10.1137/0217010zbMath0637.68044OpenAlexW1971842242WikidataQ56389441 ScholiaQ56389441MaRDI QIDQ3777450
Christopher J. Van Wyk, Robert Endre Tarjan
Publication date: 1988
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0217010
Translating polygons with applications to hidden surface removal,
Graphics in flatland revisited,
Fast algorithms for one-dimensionsal compaction with jog insertion,
A linear-time algorithm for constructing a circular visibility diagram,
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons,
Motion planning in the presence of movable obstacles,
Decomposition and intersection of simple splinegons,
An optimal visibility graph algorithm for triangulated simple polygons,
On the geodesic Voronoi diagram of point sites in a simple polygon,
An algorithmic approach to some problems in terrain navigation,
On geodesic properties of polygons relevant to linear time triangulation,
On the correctness of a linear-time visibility polygon algorithm∗,
A survey of motion planning and related geometric algorithms,
An efficient randomized algorithm for higher-order abstract Voronoi diagrams,
Visibility and intersection problems in plane geometry,
Storing line segments in partition trees,
Computational geometry in a curved world,
Triangulating a simple polygon in linear time,
Tiling polygons with parallelograms,
Finding minimum-cost flows by double scaling,
Optimal parallel algorithms for point-set and polygon problems,
Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures,
Computing bushy and thin triangulations,
The zookeeper route problem,
Minimum vertex hulls for polyhedral domains,
Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons,
Computing the geodesic center of a simple polygon,
Computing simple circuits from a set of line segments,
On the minimality of polygon triangulation,
Shortest watchman routes in simple polygons,
Computing geodesic furthest neighbors in simple polygons,
A fast Las Vegas algorithm for triangulating a simple polygon,
Optimal shortest path queries in a simple polygon,
Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences,
A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons,
A workbench for computational geometry,
Geometric classification of triangulations and their enumeration in a convex polygon
