Pages that link to "Item:Q1176324"

The following pages link to Triangulating a simple polygon in linear time (Q1176324):

Displaying 24 items.

• OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS (Q5305065) (← links)
• Peeling Potatoes Near-Optimally in Near-Linear Time (Q5363383) (← links)
• Optimal Triangulation with Steiner Points (Q5387801) (← links)
• Implementation of the convex polygon triangulation algorithm (Q5403508) (← links)
• Time-space trade-offs for triangulating a simple polygon (Q5745387) (← links)
• Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions (Q5864671) (← links)
• Fast enumeration algorithms for non-crossing geometric graphs (Q5896957) (← links)
• Characterizing LR-visibility polygons and related problems (Q5931367) (← links)
• An addition to art galleries with interior walls (Q5932813) (← links)
• A randomized algorithm for triangulating a simple polygon in linear time (Q5946382) (← links)
• Conformal mapping in linear time (Q5962354) (← links)
• Tiling with Squares and Packing Dominos in Polynomial Time (Q6051995) (← links)
• Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time (Q6102307) (← links)
• Fast skeleton construction (Q6102331) (← links)
• Shortcut hulls: vertex-restricted outer simplifications of polygons (Q6103172) (← links)
• Optimal Area Polygonization by Triangulation and Visibility Search (Q6163583) (← links)
• (Q6179335) (← links)
• Computing in linear time a chord from which a simple polygon is weakly internally visible (Q6487941) (← links)
• Illumination with orthogonal floodlights (Q6487984) (← links)
• Finding the medial axis of a simple polygon in linear time (Q6487986) (← links)
• Testing the planar straight-line realizability of 2-trees with prescribed edge lengths (Q6563990) (← links)
• Triangulation of simple arbitrarily shaped polyhedra by cutting off one vertex at a time (Q6569247) (← links)
• A sub-quadratic time algorithm for computing the beacon kernel of simple polygons (Q6591621) (← links)
• Uniformly monotone partitioning of polygons (Q6593668) (← links)