Pages that link to "Item:Q3777450"
From MaRDI portal
The following pages link to An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon (Q3777450):
Displaying 38 items.
- Computing the geodesic center of a simple polygon (Q582099) (← links)
- Computing simple circuits from a set of line segments (Q583232) (← links)
- On the minimality of polygon triangulation (Q751276) (← links)
- Shortest watchman routes in simple polygons (Q751818) (← links)
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons (Q809630) (← links)
- Visibility and intersection problems in plane geometry (Q910213) (← links)
- Storing line segments in partition trees (Q911289) (← links)
- Computational geometry in a curved world (Q911324) (← links)
- Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons (Q982944) (← links)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons (Q1101226) (← links)
- Decomposition and intersection of simple splinegons (Q1105375) (← 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)
- An algorithmic approach to some problems in terrain navigation (Q1116366) (← links)
- On geodesic properties of polygons relevant to linear time triangulation (Q1118350) (← links)
- A survey of motion planning and related geometric algorithms (Q1123032) (← links)
- Triangulating a simple polygon in linear time (Q1176324) (← links)
- Tiling polygons with parallelograms (Q1184161) (← links)
- Finding minimum-cost flows by double scaling (Q1184348) (← links)
- Optimal parallel algorithms for point-set and polygon problems (Q1187196) (← links)
- Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures (Q1189285) (← links)
- Computing bushy and thin triangulations (Q1190294) (← links)
- The zookeeper route problem (Q1193837) (← links)
- Minimum vertex hulls for polyhedral domains (Q1199529) (← links)
- A workbench for computational geometry (Q1322571) (← links)
- Geometric classification of triangulations and their enumeration in a convex polygon (Q1324413) (← links)
- Motion planning in the presence of movable obstacles (Q1356169) (← links)
- Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences (Q1575559) (← links)
- Computing geodesic furthest neighbors in simple polygons (Q1822979) (← links)
- A fast Las Vegas algorithm for triangulating a simple polygon (Q1823686) (← links)
- Optimal shortest path queries in a simple polygon (Q1823689) (← links)
- A linear-time algorithm for constructing a circular visibility diagram (Q1897474) (← links)
- An efficient randomized algorithm for higher-order abstract Voronoi diagrams (Q2414862) (← links)
- On the correctness of a linear-time visibility polygon algorithm<sup>∗</sup> (Q4009735) (← links)
- (Q4698691) (← links)
- Translating polygons with applications to hidden surface removal (Q5056092) (← links)
- Graphics in flatland revisited (Q5056094) (← links)
- Fast algorithms for one-dimensionsal compaction with jog insertion (Q5060150) (← links)
