Robust and Fast Algorithm for a Circle Set Voronoi Diagram in a Plane
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Robust Geometric Computation Based on Topological Consistency
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Topology-Oriented Approach to Robust Geometric Computation
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Exact Computation of 4-D Convex Hulls with Perturbation and Acceleration
PG '99 Proceedings of the 7th Pacific Conference on Computer Graphics and Applications
| Hi-index | 0.00 |
The paper presents a method for accelerating an exact arithmetic geometric algorithm. The exact arithmetic is one of the most promising approaches for making numerically robust geometric algorithms, because it enables us to always judge the topological structures of objects correctly and thus makes us free from inconsistency. However, exact arithmetic costs much more time than floating point arithmetic. In order to decrease this cost, the paper studies a hybrid method using both exact and floating point arithmetic. For each judgement in the algorithm, floating point arithmetic is first applied, and exact arithmetic is used only when the floating point computation is not reliable. This idea is applied to the construction of three dimensional convex hulls, and experiments show that 80/spl sim/95% of the computational cost can be saved.