Geek asks and answers

A computational geometry algorithm that can process conical arc segments

I just finished reading a book called Algorithms and Applications of Computational Geometry. The algorithm presented in this book is very useful for my future work.

But the algorithm in this book only deals with straight segments. what I want to know is the same algorithm that can deal with both straight and conical arcs.

Such as finding the intersection of mixed line segments and conical arcs; offset polygon with conical arcs; find the convex hull of a concave polygon with a conical arc edge ...

Third-party libraries such as CGAL can deal with such problems, but I want to know the details of the algorithm. What book or materials should I refer to?

+5
source share
1 answer

In general, computational geometry with curved arcs is more complex and less studied. But not unknown, and often similar methods are enough. One place to watch is CGAL, as you know; and LEDA, especially here :


        LEDA curved geom

(Added): In response to a literature request for a link, you can start from the document below and search back in time through your links and forward in time via Google Scholar (which reports that it is cited in 79 articles):

, , , , , " ". 2461, 2002, . 174-186. ( Springer)

+3

More articles:


All Articles