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.

Morse-smale complexes for piecewise linear 3-manifolds: Label: en
Molecular shape analysis based upon the morse-smale complex and the connolly function: Label: en
Loops in reeb graphs of 2-manifolds: Label: en
An optimal algorithm for the minimum edge cardinality cut surface problem: Label: en
Shape dimension and intrinsic metric from samples of manifolds with high co-dimension: Label: en
Estimating surface normals in noisy point cloud data: Label: en
Restricted delaunay triangulations and normal cycle: Label: en
Curve reconstruction from noisy samples: Label: en
The smallest enclosing ball of balls: Label: en
Hausdorff distance under translation for points and balls: Label: en
Optimized color gamuts for tiled displays: Label: en
Controlled perturbation for arrangements of circles: Label: en
Constructive root bound for <tt> k </tt>-ary rational input numbers: Label: en
Near-optimal parameterization of the intersection of quadrics: Label: en
Cache-oblivious data structures for orthogonal range searching: Label: en
Cost-driven octree construction schemes: Label: en
Proximate planar point location: Label: en
Incremental constructions con BRIO: Label: en
Complexity of the delaunay triangulation of points on surfaces the smooth case: Label: en
Anisotropic voronoi diagrams and guaranteed-quality anisotropic mesh generation: Label: en
Updating and constructing constrained delaunay and constrained regular triangulations by flips: Label: en
Local polyhedra and geometric graphs: Label: en
The complexity of (un)folding: Label: en
Planar minimally rigid graphs and pseudo-triangulations: Label: en
Spatial embedding of pseudo-triangulations: Label: en
Curve-sensitive cuttings: Label: en
New constructions of weak epsilon-nets: Label: en
Long monotone paths in line arrangements: Label: en
On conflict-free coloring of points and simple regions in the plane: Label: en
A tight bound for the number of different directions in three dimensions: Label: en
Distinct distances in homogeneous sets: Label: en
Topological graphs with no self-intersecting cycle of length 4: Label: en
Geometric algorithms for static leaf sequencing problems in radiation therapy: Label: en
Good NEWS: Label: en
Efficient algorithms for shared camera control: Label: en
Polygon decomposition based on the straight line skeleton: Label: en
Smooth kinetic maintenance of clusters: Label: en
High-dimensional shape fitting in linear time: Label: en
Shape fitting with outliers: Label: en
Approximation algorithms for aligning points: Label: en
Euclidean bounded-degree spanning tree ratios: Label: en
Fault-tolerant geometric spanners: Label: en