Pages that link to "Item:Q1176324"
From MaRDI portal
The following pages link to Triangulating a simple polygon in linear time (Q1176324):
Displaying 50 items.
- An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments (Q283875) (← links)
- Distance-sensitive planar point location (Q283883) (← links)
- Maintaining visibility of a polygon with a moving point of view (Q293260) (← links)
- Partitioning orthogonal polygons into \(\leq 8\)-vertex pieces, with application to an art gallery theorem (Q340521) (← links)
- A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams (Q340524) (← links)
- Reprint of: Memory-constrained algorithms for simple polygons (Q390167) (← links)
- On a class of \(O(n^2)\) problems in computational geometry (Q419363) (← links)
- Space-time trade-offs for stack-based algorithms (Q494797) (← links)
- Computing the visibility polygon of an island in a polygonal domain (Q513290) (← links)
- Computing hereditary convex structures (Q540446) (← links)
- Representing a functional curve by curves with fewer peaks (Q635753) (← links)
- Preprocessing imprecise points for Delaunay triangulation: simplified and extended (Q644800) (← links)
- Algorithms for deciding the containment of polygons (Q671621) (← links)
- An optimal algorithm for finding the edge visibility polygon under limited visibility (Q673918) (← links)
- Finding a shortest diagonal of a simple polygon in linear time (Q676568) (← links)
- LR-visibility in polygons (Q676582) (← links)
- Geometric pattern matching under Euclidean motion (Q676592) (← links)
- Linear-time algorithms for weakly-monotone polygons (Q685601) (← links)
- A linear-time algorithm for the geodesic center of a simple polygon (Q728492) (← links)
- A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions (Q728493) (← links)
- Finding minimal nested polygons (Q802901) (← links)
- A 2-approximation algorithm for the zookeeper's problem (Q845863) (← links)
- Near optimal line segment queries in simple polygons (Q891822) (← links)
- Guarding curvilinear art galleries with vertex or point guards (Q924067) (← links)
- Efficient generation of simple polygons for characterizing the shape of a set of points in the plane (Q936454) (← links)
- Towards a definition of higher order constrained Delaunay triangulations (Q1005329) (← links)
- Finding shortest safari routes in simple polygons (Q1014417) (← links)
- An approximative solution to the Zookeeper's problem (Q1014446) (← links)
- Delaunay triangulation of imprecise points in linear time after preprocessing (Q1037646) (← links)
- Decompositions and boundary coverings of non-convex fat polyhedra (Q1037773) (← links)
- Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures (Q1189285) (← links)
- Dynamic output-sensitive hidden surface removal for \(c\)-oriented polyhedra (Q1196293) (← links)
- Special subgraphs of weighted visibility graphs (Q1199937) (← links)
- Hamiltonian triangulations and circumscribing polygons of disjoint line segments (Q1200910) (← links)
- Minimum-link paths among obstacles in the plane (Q1201747) (← links)
- Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
- Shortest curves in planar regions with curved boundary (Q1210291) (← links)
- Checking the convexity of polytopes and the planarity of subdivisions (Q1276945) (← links)
- Stabbing information of a simple polygon (Q1283786) (← links)
- Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs (Q1315998) (← links)
- Computing a median point of a simple rectilinear polygon (Q1321814) (← links)
- Geometric classification of triangulations and their enumeration in a convex polygon (Q1324413) (← links)
- Computing minimum length paths of a given homotopy class (Q1330462) (← links)
- Ray shooting in polygons using geodesic triangulations (Q1330785) (← links)
- An algorithm for recognizing palm polygons (Q1345480) (← links)
- New results on binary space partitions in the plane (Q1370930) (← links)
- Converting triangulations to quadrangulations (Q1384213) (← links)
- Note on an art gallery problem (Q1388132) (← links)
- On triangulating three-dimensional polygons (Q1392846) (← links)
- Approximation algorithms for the watchman route and zookeeper's problems. (Q1427191) (← links)
