The following pages link to Vladlen Koltun (Q701795):
Displaying 37 items.
- Sharp bounds for vertical decompositions of linear arrangements in four dimensions (Q701796) (← links)
- On the union of \(\kappa\)-round objects in three and four dimensions (Q854705) (← links)
- Approximately dominating representatives (Q870264) (← links)
- On overlays and minimization diagrams (Q1014331) (← links)
- Smoothed analysis of probabilistic roadmaps (Q1028227) (← links)
- Ready, set, go! The Voronoi diagram of moving points that start from a line (Q1029088) (← links)
- Segment intersection searching problems in general settings (Q1404529) (← links)
- Polyhedral Voronoi diagrams of polyhedra in three dimensions (Q1424319) (← links)
- Matching polyhedral terrains using overlays of envelopes (Q1763153) (← links)
- Incidences between points and circles in three and higher dimensions (Q1772129) (← links)
- Lines avoiding unit balls in three dimensions (Q2571322) (← links)
- (Q2921707) (← links)
- Efficient algorithms for bichromatic separability (Q2944513) (← links)
- Almost tight upper bounds for vertical decompositions in four dimensions (Q3069906) (← links)
- (Q3601564) (← links)
- Incidences between points and circles in three and higher dimensions (Q4557545) (← links)
- Three dimensional euclidean Voronoi diagrams of lines with a fixed number of orientations (Q4557557) (← links)
- Polyhedral Voronoi diagrams of polyhedra in three dimensions (Q4557558) (← links)
- 3-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations (Q4706221) (← links)
- The Partition Technique for Overlays of Envelopes (Q4706235) (← links)
- (Q4778546) (← links)
- (Q4829017) (← links)
- Dense scene reconstruction with points of interest (Q5174788) (← links)
- Smoothed Analysis of Probabilistic Roadmaps (Q5194618) (← links)
- Algorithm Theory - SWAT 2004 (Q5315364) (← links)
- Database Theory - ICDT 2005 (Q5316595) (← links)
- Curve-Sensitive Cuttings (Q5317179) (← links)
- Segment intersection searching problems in general settings (Q5361577) (← links)
- Efficient algorithms for shared camera control (Q5361605) (← links)
- Curve-sensitive cuttings (Q5361616) (← links)
- On lines avoiding unit balls in three dimensions (Q5361652) (← links)
- On the union of κ-round objects (Q5361693) (← links)
- Algorithms and Data Structures (Q5394270) (← links)
- (Q5501327) (← links)
- Algorithms and Computation (Q5897837) (← links)
- Cutting triangular cycles of lines in space (Q5901090) (← links)
- Cutting triangular cycles of lines in space (Q5916174) (← links)
