Pages that link to "Item:Q2744733"

The following pages link to A contribution to triangulation algorithms for simple polygons (Q2744733):

Displaying 8 items.

• An efficient algorithm for finding the CSG representation of a simple polygon (Q1261285) (← links)
• A triangulation and fill-reducing initialization procedure for the simplex algorithm (Q2062318) (← links)
• Memory-constrained algorithms for simple polygons (Q2391542) (← links)
• A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation (Q2489546) (← links)
• An algorithm for dynamic Delaunay triangulation of simple polygon (Q2887614) (← links)
• A heuristic triangulation algorithm (Q3776650) (← links)
• An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon (Q3777450) (← links)
• A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points (Q5114888) (← links)