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 44 results in range #1 to #44.

Systems of distant representatives in euclidean space: Label: en
Lower bounds for k-distance approximation: Label: en
Measuring similarity between curves on 2-manifolds via homotopy area: Label: en
A new approach to crushing 3-manifold triangulations: Label: en
Computing closed essential surfaces in knot complements: Label: en
Geometry in the space of persistence modules: Label: en
Zigzag zoology: Label: en
The complexity of separating points in the plane: Label: en
Computing shortest paths among curved obstacles in the plane: Label: en
A near-optimal algorithm for shortest paths among curved obstacles in the plane: Label: en
On soft predicates in subdivision motion planning: Label: en
Polyominoes on twisted cylinders: Label: en
Capture bounds for visibility-based pursuit evasion: Label: en
Sharp bounds on Davenport-Schinzel sequences of every order: Label: en
Ramsey-type results for semi-algebraic relations: Label: en
Fast segment insertion and incremental construction of constrained delaunay triangulations: Label: en
A fast algorithm for well-spaced points and approximate delaunay graphs: Label: en
Bichromatic compatible matchings: Label: en
Topological graphs: Label: en
Counting and sampling minimum cuts in genus g graphs: Label: en
A constant-factor approximation for multi-covering with disks: Label: en
Small-size relative ( p ,ε)-approximations for well-behaved range spaces: Label: en
Range counting coresets for uncertain data: Label: en
Compressive sensing using locality-preserving matrices: Label: en
Diverse near neighbor problem: Label: en
On the 2-sum embedding conjecture: Label: en
The maximum number of faces of the minkowski sum of three convex polytopes: Label: en
Union of random minkowski sums and network vulnerability analysis: Label: en
Complexity analysis of random geometric structures made simpler: Label: en
Recent progress on the combinatorial diameter of polyhedra and simplicial complexes: Label: en
Competitive query strategies for minimising the ply of the potential locations of moving points: Label: en
Kinetic 2-centers in the black-box model: Label: en
Kinetic data structures for all nearest neighbors and closest pair in the plane: Label: en
Homological reconstruction and simplification in R ³: Label: en
Improved bounds for incidences between points and circles: Label: en
On planar point sets with the pentagon property: Label: en
On a forgotten conjecture from a famous paper of Erdös: Label: en
Hyperbolic delaunay complexes and voronoi diagrams made practical: Label: en
A parallel algorithm for computing the flow complex: Label: en
Localized delaunay refinement for piecewise-smooth complexes: Label: en
Efficiently hex-meshing things with topology: Label: en
The graphs of planar soap bubbles: Label: en
A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates: Label: en
A simple aggregative algorithm for counting triangulations of planar point sets and related problems: Label: en