| Publication | Date of Publication | Type |
|---|
scientific article; zbMATH DE number 7662633 (Why is no real title available?)
| 2023-03-13 | Paper |
Cost prediction for ray shooting
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Towards in-place geometric algorithms and data structures
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
The number of lines tangent to arbitrary convex polyhedra in 3D
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Cost-driven octree construction schemes
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Managing cohort movement of mobile sensors via GPS-free and compass-free node localization
Journal of Parallel and Distributed Computing | 2012-03-07 | Paper |
The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra
Mathematical Software – ICMS 2010 | 2010-09-14 | Paper |
A new deterministic data aggregation method for wireless sensor networks
Signal Processing | 2010-05-19 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Minimum-cost coverage of point sets by disks
| 2009-02-10 | Paper |
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra
SIAM Journal on Computing | 2008-04-22 | Paper |
Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane
Discrete and Computational Geometry | 2008-03-18 | Paper |
Opposite-quadrant depth in the plane
Graphs and Combinatorics | 2007-07-19 | Paper |
Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
SIAM Journal on Computing | 2007-06-26 | Paper |
Lines tangent to four triangles in three-dimensional space
Discrete \& Computational Geometry | 2007-04-26 | Paper |
Octrees with near optimal cost for ray-shooting
Computational Geometry | 2006-06-30 | Paper |
Cost prediction for ray shooting in octrees
Computational Geometry | 2006-06-30 | Paper |
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
Computational Geometry | 2006-05-16 | Paper |
The design of the Boost interval arithmetic library
Theoretical Computer Science | 2006-03-20 | Paper |
Transversals to line segments in three-dimensional space
Discrete \& Computational Geometry | 2005-11-10 | Paper |
Cost-driven octree construction schemes: An experimental study
Computational Geometry | 2005-05-04 | Paper |
scientific article; zbMATH DE number 2086251 (Why is no real title available?)
| 2004-08-11 | Paper |
Space-efficient planar convex hull algorithms
Theoretical Computer Science | 2004-08-10 | Paper |
scientific article; zbMATH DE number 1962821 (Why is no real title available?)
| 2003-08-11 | Paper |
scientific article; zbMATH DE number 1848392 (Why is no real title available?)
| 2003-01-05 | Paper |
scientific article; zbMATH DE number 1786501 (Why is no real title available?)
| 2002-08-21 | Paper |
Interval arithmetic yields efficient dynamic filters for computational geometry
Discrete Applied Mathematics | 2001-04-04 | Paper |
Efficient exact evaluation of signs of determinants
Algorithmica | 2000-06-22 | Paper |
Degenerate convex hulls on-line in any fixed dimension
Discrete \& Computational Geometry | 1999-11-25 | Paper |
Product Range Spaces, Sensitive Sampling, and Derandomization
SIAM Journal on Computing | 1999-10-28 | Paper |
Sign determination in residue number systems
Theoretical Computer Science | 1999-01-12 | Paper |
Optimal slope selection via cuttings
Computational Geometry | 1998-10-11 | Paper |
Almost optimal set covers in finite VC-dimension
Discrete \& Computational Geometry | 1996-02-06 | Paper |
How hard is half-space range searching?
Discrete \& Computational Geometry | 1993-09-30 | Paper |
