loading...
Exact Computation of 4-D Convex Hulls with Perturbation and Acceleration
Seoul, Korea October 05-October 07
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PCCGA.1999.803350Seventh Pacific Conference on Compute ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An incremental algorithm for constructing the four-dimensional convex hull is implemented using exact arithmetic together with the symbolic perturbation technique. Exact judgement of the topological structure of the four-dimensional convex hull requires about four times higher precision than the input. To decrease this computational cost, the lazy evaluation scheme is used. Experiments show that the computation can be accelerated more than one hundred times for non-degenerate input and more than three times even for highly degenerate input.
Citation:
Kokichi Sugihara, "Exact Computation of 4-D Convex Hulls with Perturbation and Acceleration," pg, pp.70, Seventh Pacific Conference on Computer Graphics and Applications (PG'99), 1999
Usage of this product signifies your acceptance of the Terms of Use.