Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 42 results in range #1 to #42.

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