| Publication | Date of Publication | Type |
|---|
Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Rods and Rings: Soft Subdivision Planner for R^3 x S^2.
(available as arXiv preprint) | 2022-07-18 | Paper |
Cost prediction for ray shooting
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
On minimum-area hulls (extended abstract)
Algorithms — ESA '96 | 2017-12-05 | Paper |
Cost-driven octree construction schemes
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
| scientific article; zbMATH DE number 6472595 (Why is no real title available?) | 2015-08-14 | Paper |
On soft predicates in subdivision motion planning
Computational Geometry | 2015-07-27 | Paper |
On soft predicates in subdivision motion planning
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Analysis of predicted frequency of miss of hospitals by using the Grey Model (1, 1) and control charts: case study of a medical center in Taipei city
Journal of Information and Optimization Sciences | 2009-11-10 | Paper |
Cost prediction for ray shooting in octrees
Computational Geometry | 2006-06-30 | Paper |
Cost-driven octree construction schemes: An experimental study
Computational Geometry | 2005-05-04 | Paper |
New approximation results for the maximum scatter TSP
Algorithmica | 2005-04-29 | Paper |
Simple and optimal output-sensitive construction of contour trees using monotone paths
Computational Geometry | 2005-01-31 | Paper |
| scientific article; zbMATH DE number 1424320 (Why is no real title available?) | 2000-09-06 | Paper |
On the Maximum Scatter Traveling Salesperson Problem
SIAM Journal on Computing | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1305410 (Why is no real title available?) | 1999-06-17 | Paper |
On minimum-area hulls
Algorithmica | 1998-10-01 | Paper |
Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep
Computational Geometry | 1998-04-13 | Paper |
Optimal Shortest Path and Minimum-Link Path Queries between Two Convex Polygons inside a Simple Polygonal Obstacle
International Journal of Computational Geometry & Applications | 1997-07-27 | Paper |
| scientific article; zbMATH DE number 910869 (Why is no real title available?) | 1996-11-04 | Paper |
A Unified Approach to Dynamic Point Location, Ray shooting, and Shortest Paths in Planar Maps
SIAM Journal on Computing | 1996-07-02 | Paper |
| scientific article; zbMATH DE number 437528 (Why is no real title available?) | 1994-01-02 | Paper |
DYNAMIZATION OF THE TRAPEZOID METHOD FOR PLANAR POINT LOCATION IN MONOTONE SUBDIVISIONS
International Journal of Computational Geometry & Applications | 1993-04-01 | Paper |
