Pages that link to "Item:Q1380782"

The following pages link to The nature and meaning of perturbations in geometric computing (Q1380782):

Displaying 16 items.

• The higher-order Voronoi diagram of line segments (Q261375) (← links)
• Perturbations for Delaunay and weighted Delaunay 3D triangulations (Q617544) (← links)
• A general approach to the analysis of controlled perturbation algorithms (Q654290) (← links)
• A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters (Q727968) (← links)
• Solving the minimum convex partition of point sets with integer programming (Q824341) (← links)
• Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time (Q1037652) (← links)
• A perturbation scheme for spherical arrangements with application to molecular modeling (Q1265287) (← links)
• How good are convex hull algorithms? (Q1356937) (← links)
• On geometric optimization with few violated constraints (Q1906043) (← links)
• Analytical aspects of tie breaking (Q1929235) (← links)
• Exact, robust, and efficient regularized Booleans on general 3D meshes (Q2006434) (← links)
• Linear perturbation methods for topologically consistent representations of free-form surface intersections (Q2388559) (← links)
• Counting hexagonal patches and independent sets in circle graphs (Q2429365) (← links)
• Preferred directions for resolving the non-uniqueness of Delaunay triangulations (Q2489018) (← links)
• The predicates of the Apollonius diagram: algorithmic analysis and implementation (Q2575585) (← links)
• Exact and heuristic solutions for the prize‐collecting geometric enclosure problem (Q6154939) (← links)