Entity usage

Showing below up to 36 results in range #1 to #36.

1. Projective clustering in high dimensions using core-sets: Label: en
2. Visibility preserving terrain simplification: Label: en
3. Cost prediction for ray shooting: Label: en
4. Improved construction of vertical decompositions of three-dimensional arrangements: Label: en
5. Hybrid meshes: Label: en
6. Optimal decomposition of polygonal models into triangle strips: Label: en
7. Optimally cutting a surface into a disk: Label: en
8. Vertex-unfoldings of simplicial manifolds: Label: en
9. Polyhedral Voronoi diagrams of polyhedra in three dimensions: Label: en
10. Three dimensional euclidean Voronoi diagrams of lines with a fixed number of orientations: Label: en
11. The probabilistic complexity of the Voronoi diagram of points on a polyhedron: Label: en
12. Conforming Delaunay triangulations in 3D: Label: en
13. Interlocked open linkages with few joints: Label: en
14. Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons: Label: en
15. Pseudo approximation algorithms, with applications to optimal motion planning: Label: en
16. Testing Homotopy for paths in the plane: Label: en
17. Quickest paths, straight skeletons, and the city Voronoi diagram: Label: en
18. The Delaunay tetrahedralization from Delaunay triangulated surfaces: Label: en
19. Guaranteed: Label: en
20. Pseudotriangulations, polytopes, and how to expand linkages: Label: en
21. Lenses in arrangements of pseudo-circles and their applications: Label: en
22. Incidences between points and circles in three and higher dimensions: Label: en
23. Point-line incidences in space: Label: en
24. Approximate nearest neighbor algorithms for Frechet distance via product metrics: Label: en
25. The one-round Voronoi game: Label: en
26. A lower bound on the distortion of embedding planar metrics into Euclidean space: Label: en
27. The power of nonmonotonicity in geometric searching: Label: en
28. A global approach to automatic solution of jigsaw puzzles: Label: en
29. Finding the consensus shape for a protein family: Label: en
30. Box-trees for collision checking in industrial installations: Label: en
31. Efficient maintenance and self-collision testing for Kinematic Chains: Label: en
32. Collision detection for deforming necklaces: Label: en
33. On the number of embeddings of minimally rigid graphs: Label: en
34. On the crossing number of complete graphs: Label: en
35. A local search approximation algorithm for k-means clustering: Label: en
36. Parametric search made practical: Label: en