The following pages link to (Q3704927):
Displaying 7 items.
- A linear-time algorithm to compute the triangular hull of a digital object (Q528337) (← links)
- Some chain visibility problems in a simple polygon (Q911765) (← links)
- On geodesic properties of polygons relevant to linear time triangulation (Q1118350) (← links)
- Computing bushy and thin triangulations (Q1190294) (← links)
- On polyhedra induced by point sets in space (Q2462350) (← links)
- A linear-time algorithm for solving the strong hidden-line problem in a simple polygon (Q3776622) (← links)
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon (Q3777450) (← links)
