Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Topology-oriented incremental algorithm for the robust construction of the Voronoi diagrams of disks
Lee M., Sugihara K., Kim D. ACM Transactions on Mathematical Software43 (2):1-23,2016.Type:Article
Date Reviewed: Jan 20 2017

Voronoi diagrams are important in many applications that range from theoretical computing to computational geometry, to computer graphics and computer vision. The relatively new problem of computing the Voronoi diagram for a set of geometry primitives with non-zero areas, rather than a set of points, is considerably more challenging. This paper deals with the case when the geometry primitives are a set of disks. Applications of these include pattern generation and circle packing.

The technique proposed in the paper is an intelligent extension of the existing work with a focus on being topologically sound. This paper is interesting not only for researchers in computational geometry, computer graphics, and computer vision, but also software developers and numerical simulation practitioners, due to the application of Voronoi diagrams with domain tessellation and meshing.

Reviewer:  Eugene Zhang Review #: CR145016 (1705-0311)
Bookmark and Share
  Featured Reviewer  
 
Geometric Algorithms, Languages, And Systems (I.3.5 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Geometric Algorithms, Languages, And Systems": Date
Depth-order point classification techniques for CSG display algorithms
Jansen F. (ed) ACM Transactions on Graphics (TOG) 2(3): 40-70, 1983. Type: Article
Aug 1 1991
Oriented projective geometry
Stolfi J., Academic Press Prof., Inc., San Diego, CA, 1991. Type: Book (9780126720259)
Jul 1 1992
A linear time algorithm for computing the convex hull of an ordered crossing polygon
Ghosh S., Shyamasundar R. Pattern Recognition 17(3): 351-358, 1984. Type: Article
Jan 1 1985
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy