The following pages link to Leonidas J. Guibas (Q534491):
Displayed 50 items.
- Morphing simple polygons (Q1577545) (← links)
- Lower bounds for kinetic planar subdivisions (Q1591059) (← links)
- Optimal shortest path queries in a simple polygon (Q1823689) (← links)
- The earth mover's distance as a metric for image retrieval (Q1859688) (← links)
- New similarity measures between polylines with applications to morphing and polygon sweeping (Q1864114) (← links)
- Vertical decomposition of arrangements of hyperplanes in four dimensions (Q1895966) (← links)
- Vertical decompositions for triangles in 3-space (Q1907609) (← links)
- Lines in space: Combinatorics and algorithms (Q1913699) (← links)
- The exact fitting problem in higher dimensions (Q1917054) (← links)
- A method for obtaining randomized algorithms with small tail probabilities (Q1923864) (← links)
- Witnessed \(k\)-distance (Q1942306) (← links)
- A hierarchical method for real-time distance computation among moving convex bodies (Q1974624) (← links)
- Shape part transfer via semantic latent space factorization (Q2305262) (← links)
- Constructing strongly convex approximate hulls with inaccurate primitives (Q2366235) (← links)
- A package for exact kinetic data structures and sweepline algorithms (Q2371341) (← links)
- On incremental rendering of silhouette maps of a polyhedral scene (Q2385692) (← links)
- Geometric filtering of pairwise atomic interactions applied to the design of efficient statistical potentials (Q2506963) (← links)
- Corrigendum: Topologically sweeping an arrangement (Q2638777) (← links)
- (Q2708236) (← links)
- (Q2721992) (← links)
- (Q2721993) (← links)
- (Q2749774) (← links)
- (Q2768287) (← links)
- (Q2768363) (← links)
- Convolutional wasserstein distances (Q2802296) (← links)
- (Q2880918) (← links)
- (Q2934702) (← links)
- Compressive Network Analysis (Q2982946) (← links)
- Bounded Uncertainty Roadmaps for Path Planning (Q3079471) (← links)
- (Q3138742) (← links)
- (Q3138890) (← links)
- (Q3138981) (← links)
- COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS (Q3212329) (← links)
- Finding Extremal Polygons (Q3221405) (← links)
- (Q3481216) (← links)
- (Q3685222) (← links)
- (Q3687756) (← links)
- Primitives for the manipulation of general subdivisions and the computation of Voronoi (Q3711764) (← links)
- Probabilistic analysis of a network resource allocation algorithm (Q3720324) (← links)
- Optimal Point Location in a Monotone Subdivision (Q3738618) (← links)
- An O(n2) shortest path algorithm for a non-rotating convex body (Q3792242) (← links)
- (Q3795219) (← links)
- (Q3796750) (← links)
- Long repetitive patterns in random sequences (Q3859018) (← links)
- A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm (Q3891777) (← links)
- (Q4036602) (← links)
- (Q4038708) (← links)
- The Analysis of Hashing Techniques That Exhibit <i>k</i> -ary Clustering (Q4170232) (← links)
- Maximal Prefix-Synchronized Codes (Q4177474) (← links)
- Data Structures for Mobile Data (Q4240126) (← links)