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

k-means requires exponentially many iterations even in the plane: Label: en
Arrangements of double pseudolines: Label: en
Flattening single-vertex origami: Label: en
A proof of the molecular conjecture: Label: en
A general approach for cache-oblivious range reporting and approximate range counting: Label: en
Cache-oblivious range reporting with optimal queries requires superlinear space: Label: en
Area-universal rectangular layouts: Label: en
Distributed vision with smart pixels: Label: en
Zigzag persistent homology and real-valued functions: Label: en
Proximity of persistence modules and their diagrams: Label: en
Persistent cohomology and circular coordinates: Label: en
Parallel geometric algorithms for multi-core computers: Label: en
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension: Label: en
The geodesic farthest-site Voronoi diagram in a polygonal domain with holes: Label: en
Divide-and-conquer for Voronoi diagrams revisited: Label: en
The Euclidean degree-4 minimum spanning tree problem is NP-hard: Label: en
Embedding rivers in polyhedral terrains: Label: en
Visibility maps of realistic terrains have linear smoothed complexity: Label: en
Approximate center points with proofs: Label: en
Candle in the woods: Label: en
Halving lines and measure concentration in the plane: Label: en
An improved bound on the number of unit area triangles: Label: en
Cut locus and topology from surface point data: Label: en
Integral estimation from point cloud in d-dimensional space: Label: en
The scale axis transform: Label: en
Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection: Label: en
Binary plane partitions for disjoint line segments: Label: en
Computing hereditary convex structures: Label: en
Shooting permanent rays among disjoint polygons in the plane: Label: en
Kinetic spanners in R ^d: Label: en
Coresets for polytope distance: Label: en
Near-linear approximation algorithms for geometric hitting sets: Label: en
PTAS for geometric hitting set problems via local search: Label: en
Epsilon nets and union complexity: Label: en
On grids in topological graphs: Label: en
Minimum Manhattan network is NP-complete: Label: en
Diameter of polyhedra: Label: en
Minimum cuts and shortest homologous cycles: Label: en
Randomly removing g handles at once: Label: en
On the topology of planar algebraic curves: Label: en
Adaptive isotopic approximation of nonsingular curves: Label: en
On the set multi-cover problem in geometric settings: Label: en
Approximation algorithms for maximum independent set of pseudo-disks: Label: en