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

Towards and open curved kernel: Label: en
Inner and outer rounding of set operations on lattice polygonal regions: Label: en
Intersecting quadrics: Label: en
Complete, exact, and efficient computations with cubic curves: Label: en
The criss-cross method can take Ω(n ^d ) pivots: Label: en
On empty convex polygons in a planar point set: Label: en
On the union of κ-round objects: Label: en
On locally Delaunay geometric graphs: Label: en
Time-varying reeb graphs for continuous space-time data: Label: en
Extreme elevation on a 2-manifold: Label: en
Computing persistent homology: Label: en
The geometric thickness of low degree graphs: Label: en
Provable surface reconstruction from noisy samples: Label: en
Low-dimensional embedding with extra information: Label: en
A bézier-based approach to unstructured moving meshes: Label: en
Spacetime meshing with adaptive refinement and coarsening: Label: en
Quality meshing for polyhedra with small angles: Label: en
Sampling and meshing a surface with guaranteed topology and geometry: Label: en
On the least median square problem: Label: en
Practical methods for shape fitting and kinetic data structures using core sets: Label: en
Locality-sensitive hashing scheme based on p-stable distributions: Label: en
A near-linear constant-factor approximation for euclidean bipartite matching?: Label: en
Towards in-place geometric algorithms and data structures: Label: en
Binary space partitions of orthogonal subdivisions: Label: en
Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve: Label: en
Counting and representing intersections among triangles in three dimensions: Label: en
A computational framework for incremental motion: Label: en
Deformable spanners and applications: Label: en
A 2D kinetic triangulation with near-quadratic topological changes: Label: en
An empirical comparison of techniques for updating Delaunay triangulations: Label: en
Range counting over multidimensional data streams: Label: en
Faster core-set constructions and data stream algorithms in fixed dimensions: Label: en
Deterministic sampling and range counting in geometric data streams: Label: en
An energy-driven approach to linkage unfolding: Label: en
New results on shortest paths in three dimensions: Label: en
Pushing squares around: Label: en
A scalable simulator for forest dynamics: Label: en
Finding planar regions in a terrain: Label: en
Continuous path verification in multi-axis NC-machining: Label: en
Solution of Scott's problem on the number of directions determined by a point set in 3-space: Label: en
Improving the crossing lemma by finding more crossings in sparse graphs: Label: en
Algorithms for center and Tverberg points: Label: en
On distinct distances from a vertex of a convex polygon: Label: en
The number of lines tangent to arbitrary convex polyhedra in 3D: Label: en
On lines avoiding unit balls in three dimensions: Label: en
Computing the visibility graph of points within a polygon: Label: en
Approximate convex decomposition of polygons: Label: en
Separating point sets in polygonal environments: Label: en
Geodesic ham-sandwich cuts: Label: en