Pages that link to "Item:Q975526"

The following pages link to Triangulating input-constrained planar point sets (Q975526):

Displaying 9 items.

• Preprocessing imprecise points for Delaunay triangulation: simplified and extended (Q644800) (← links)
• A model to simplify 2D triangle meshes with irregular shapes (Q984322) (← links)
• Delaunay triangulation of imprecise points in linear time after preprocessing (Q1037646) (← links)
• A fully polynomial time approximation scheme for the smallest diameter of imprecise points (Q2304571) (← links)
• Delaunay Triangulation of Imprecise Points Simplified and Extended (Q3183447) (← links)
• Reducing Urban Concentration Using a Neural Network Model (Q3405723) (← links)
• Preprocessing Ambiguous Imprecise Points (Q5088972) (← links)
• The Most Likely Object to be Seen Through a Window (Q5149565) (← links)
• On algorithmic complexity of imprecise spanners (Q6071451) (← links)