Pages that link to "Item:Q5361507"

The following pages link to Proceedings of the sixteenth annual symposium on Computational geometry (Q5361507):

Displaying 42 items.

• Mesh generation for domains with small angles (Q5361508) (← links)
• Triangulations in CGAL (extended abstract) (Q5361509) (← links)
• Improving the surface cycle structure for hexahedral mesh generation (Q5361510) (← links)
• Computing integer points in Minkowski sums (Q5361511) (← links)
• Point sets with many <i>k</i> -sets (Q5361512) (← links)
• An improved bound for <i>k</i> -sets in three dimensions (Q5361513) (← links)
• Origin-embracing distributions or a continuous analogue of the upper bound theorem (Q5361514) (← links)
• A Helly-type theorem for hyperplane transversals to well-separated convex sets (Q5361515) (← links)
• A trace bound for the hereditary discrepancy (Q5361516) (← links)
• On the continuous Weber and <i>k</i> -median problems (extended abstract) (Q5361517) (← links)
• The 2-center problem with obstacles (Q5361518) (← links)
• Random sampling in geometric optimization (Q5361519) (← links)
• The analysis of a simple <i>k</i> -means clustering algorithm (Q5361520) (← links)
• An efficient, exact, and generic quadratic programming solver for geometric optimization (Q5361521) (← links)
• Accurate and efficient unions of balls (Q5361522) (← links)
• Fast software for box intersections (Q5361523) (← links)
• Algebraic methods and arithmetic filtering for exact predicates on circle arcs (Q5361524) (← links)
• Pitfalls in computing with pseudorandom determinants (Q5361525) (← links)
• Look — a Lazy Object-Oriented Kernel for geometric computation (Q5361526) (← links)
• When crossings count — approximating the minimum spanning tree (Q5361527) (← links)
• Linear programming queries revisited (Q5361528) (← links)
• Point set labeling with specified positions (Q5361529) (← links)
• I/O-efficient dynamic planar point location (extended abstract) (Q5361530) (← links)
• Linear-time triangulation of a simple polygon made easier via randomization (Q5361531) (← links)
• A simple algorithm for homeomorphic surface reconstruction (Q5361532) (← links)
• Smooth surface reconstruction via natural neighbour interpolation of distance functions (Q5361533) (← links)
• Reconstruction curves with sharp corners (Q5361534) (← links)
• Voronoi-based interpolation with higher continuity (Q5361535) (← links)
• Reachability by paths of bounded curvature in convex polygons (Q5361536) (← links)
• An algorithm for searching a polygonal region with a flashlight (Q5361537) (← links)
• Computing approximate shortest paths on convex polytopes (Q5361538) (← links)
• Densest translational lattice packing of non-convex polygons (extended abstract) (Q5361539) (← links)
• Deterministic algorithms for 3-D diameter and some 2-D lower envelopes (Q5361540) (← links)
• Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus (Q5361541) (← links)
• Testing the congruence of d-dimensional point sets (Q5361542) (← links)
• Multivariate regression depth (Q5361543) (← links)
• Kinetic collision detection for simple polygons (Q5361544) (← links)
• Kinetic connectivity for unit disks (Q5361545) (← links)
• Delaunay triangulations and Voronoi diagrams for Riemannian manifolds (Q5361547) (← links)
• Sweep algorithms for constructing higher-dimensional constrained Delaunay triangulations (Q5361548) (← links)
• Cutting glass (Q5361549) (← links)
• Viro's method disproves Ragsdale's conjecture (Q5361550) (← links)