The following pages link to Triangulating a simple polygon (Q1249042):
Displaying 50 items.
- Reprint of: Memory-constrained algorithms for simple polygons (Q390167) (← links)
- Space-time trade-offs for stack-based algorithms (Q494797) (← links)
- Computing the geodesic center of a simple polygon (Q582099) (← links)
- Geometric pattern matching under Euclidean motion (Q676592) (← links)
- Linear-time algorithms for weakly-monotone polygons (Q685601) (← links)
- On the minimality of polygon triangulation (Q751276) (← links)
- A decision procedure for optimal polyhedron partitioning (Q794166) (← links)
- On partitioning rectilinear polygons into star-shaped polygons (Q808305) (← links)
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons (Q809630) (← links)
- Some chain visibility problems in a simple polygon (Q911765) (← links)
- Minimum k-partitioning of rectilinear polygons (Q912618) (← links)
- Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons (Q982944) (← links)
- Visible surface calculation for complex unstructured polygonal scenes (Q1059281) (← links)
- Generalized Delaunay triangulation for planar graphs (Q1078807) (← links)
- The power of geometric duality (Q1082821) (← links)
- Visibility of disjoint polygons (Q1087340) (← links)
- Visibility between two edges of a simple polygon (Q1096432) (← links)
- Nonobtuse triangulation of polygons (Q1096930) (← links)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons (Q1101226) (← links)
- Hidden-surface removal in polyhedral cross-sections (Q1104083) (← links)
- Computing the link center of a simple polygon (Q1104086) (← links)
- An optimal visibility graph algorithm for triangulated simple polygons (Q1114399) (← links)
- On the geodesic Voronoi diagram of point sites in a simple polygon (Q1115602) (← links)
- On geodesic properties of polygons relevant to linear time triangulation (Q1118350) (← links)
- Triangulating a simple polygon in linear time (Q1176324) (← links)
- Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures (Q1189285) (← links)
- Computing bushy and thin triangulations (Q1190294) (← links)
- Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
- The furthest-site geodesic Voronoi diagram (Q1207795) (← links)
- Approximation algorithms for partitioning a rectangle with interior points (Q1263970) (← links)
- A workbench for computational geometry (Q1322571) (← links)
- Geometric classification of triangulations and their enumeration in a convex polygon (Q1324413) (← links)
- A simple linear algorithm for intersecting convex polygons (Q1822240) (← links)
- A unifying approach for a class of problems in the computational geometry of polygons (Q1822499) (← links)
- Computing geodesic furthest neighbors in simple polygons (Q1822979) (← links)
- A fast Las Vegas algorithm for triangulating a simple polygon (Q1823686) (← links)
- Applications of a two-dimensional hidden-line algorithm to other geometric problems (Q1838318) (← links)
- Finding a closet visible vertex pair between two polygons (Q1899450) (← links)
- Affine invariant triangulations (Q2065637) (← links)
- Triangulation algorithms for generating as-is floor plans (Q2087599) (← links)
- Computing the intersection-depth to polyhedra (Q2366234) (← links)
- On compatible triangulations of simple polygons (Q2367126) (← links)
- Memory-constrained algorithms for simple polygons (Q2391542) (← links)
- Computing conforming partitions of orthogonal polygons with minimum stabbing number (Q2402271) (← links)
- Approximation algorithms for decomposing octilinear polygons (Q2420578) (← links)
- COMPUTATIONAL AND STRUCTURAL ADVANTAGES OF CIRCULAR BOUNDARY REPRESENTATION (Q3007723) (← links)
- A new triangulation-linear class of simple polygons (Q3804191) (← links)
- Two algorithms for constructing a Delaunay triangulation (Q3883495) (← links)
- Dynamic Trees and Dynamic Point Location (Q4210167) (← links)
- EDGE GUARDS IN STRAIGHT WALKABLE POLYGONS (Q4513235) (← links)
