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.

The frechet distance revisited and extended: Label: en
Boundary of a non-uniform point cloud for reconstruction: Label: en
Efficient data structure for representing and simplifying simplicial complexes in high dimensions: Label: en
Vietoris-rips complexes also provide topologically correct reconstructions of sampled shapes: Label: en
Exact workspace boundary by extremal reaches: Label: en
Extremal reaches in polynomial time: Label: en
No dimension independent core-sets for containment under homothetics: Label: en
Tight lower bounds for the size of epsilon-nets: Label: en
The euclidean bottleneck steiner path problem: Label: en
On the euclidean bottleneck full Steiner tree problem: Label: en
The potential to improve the choice: Label: en
Covering cubes and the closest vector problem: Label: en
Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons: Label: en
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes: Label: en
Guarding polyominoes: Label: en
A new upper bound for the VC-dimension of visibility regions: Label: en
On the structure and composition of forbidden sequences, with geometric applications: Label: en
Bounds on the complexity of halfspace intersections when the bounded faces have small dimension: Label: en
Minors in random and expanding hypergraphs: Label: en
Kinetic mesh refinement in 2D: Label: en
Edge flips and deforming surface meshes: Label: en
Beating the spread: Label: en
Contact representations of planar graphs with cubes: Label: en
Sphere and dot product representations of graphs: Label: en
Integer representations of convex polygon intersection graphs: Label: en
Answering geographic questions with user generated content: Label: en
A pedagogic JavaScript program for point location strategies: Label: en
Minimum perimeter convex hull of imprecise points in convex regions: Label: en
Fitting spheres to electron density: Label: en
Visualization of discrete gradient construction: Label: en
Ant-sweep: Label: en
Geometric computation with smart pixels: Label: en
Redelmeier's algorithm for counting lattice animals: Label: en
Delaunay triangulations of point sets in closed euclidean d-manifolds: Label: en
Improved upper bound on the stretch factor of delaunay triangulations: Label: en
The Geometric Stability of Voronoi Diagrams with Respect to Small Changes of the Sites: Label: en
Kinetic convex hulls and delaunay triangulations in the black-box model: Label: en
Shortest non-trivial cycles in directed surface graphs: Label: en
Reeb graphs: Label: en
Zigzag persistent homology in matrix multiplication time: Label: en
An output-sensitive algorithm for persistent homology: Label: en
Stable snap rounding: Label: en
A generic algebraic kernel for non-linear geometric applications: Label: en
Theoretical and practical results on straight skeletons of planar straight-line graphs: Label: en
Space crossing numbers: Label: en
The pachner graph and the simplification of 3-sphere triangulations: Label: en
The least spanning area of a knot and the optimal bounding chain problem: Label: en
Disjoint compatible geometric matchings: Label: en
A center transversal theorem for hyperplanes and applications to graph drawing: Label: en
A kuratowski-type theorem for planarity of partially embedded graphs: Label: en