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

Steinitz Theorems for Orthogonal Polyhedra: Label: en
Tangencies between families of disjoint regions in the plane: Label: en
Incidences in three dimensions and distinct distances in the plane: Label: en
I/O-efficient computation of water flow across a terrain: Label: en
3D Euler spirals for 3D curve completion: Label: en
Computing planar Voronoi diagrams in double precision: Label: en
Applications of geometry and topology for quadrilateral meshprocessing and verifiable visualization: Label: en
Computing similarity between piecewise-linear functions: Label: en
Approximating the Fréchet distance for realistic curves in near linear time: Label: en
Points with large quadrant-depth: Label: en
Improving the first selection lemma in R ³: Label: en
Reconstructing shapes with guarantees by unions of convex sets: Label: en
Optimal reconstruction might be hard: Label: en
Manifold reconstruction using tangential Delaunay complexes: Label: en
Dynamic well-spaced point sets: Label: en
Acute triangulations of polyhedra and the Euclidean space: Label: en
On degrees in random triangulations of point sets: Label: en
Geometric tomography with topological guarantees: Label: en
Topological inference via meshing: Label: en
A randomized O ( m log m ) time algorithm for computing Reeb graphs of arbitrary simplicial complexes: Label: en
The tidy set: Label: en
A dynamic data structure for approximate range searching: Label: en
Orthogonal range reporting: Label: en
An improved algorithm for computing the volume of the union of cubes: Label: en
Klee's measure problem on fat boxes in time ∂( n ^{( d +2)/3} ): Label: en
Zone diagrams in Euclidean spaces and in other normed spaces: Label: en
Distance k -sectors exist: Label: en
The complexity of the normal surface solution space: Label: en
New constructions of SSPDs and their applications: Label: en
A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane: Label: en
A traveller's problem: Label: en
Approximating loops in a shortest homology basis from point data: Label: en
Finding shortest non-trivial cycles in directed graphs on surfaces: Label: en
Output-sensitive algorithm for the edge-width of an embedded graph: Label: en
A kinetic triangulation scheme for moving points in the plane: Label: en
Kinetic stable Delaunay graphs: Label: en
A geometric approach to collective motion: Label: en
Geometric methods for multi-agent collision avoidance: Label: en
Convexification of polygons by length preserving transformations: Label: en
Constructing Reeb graphs using cylinder maps: Label: en
Shape approximation using k-order alpha-hulls: Label: en
Visualizing 3D Euler spirals: Label: en
Linkless and flat embeddings in 3-space and the unknot problem: Label: en
The 2-center problem in three dimensions: Label: en
Planar visibility: Label: en
Adding one edge to planar graphs makes crossing number hard: Label: en
Lines avoiding balls in three dimensions revisited: Label: en
On the complexity of sets of free lines and line segments among balls in three dimensions: Label: en
Better bounds on the union complexity of locally fat objects: Label: en
Discrete geometric structures for architecture: Label: en