Comparison of three bounding regions with cubic convergence to planar freeform curves

Verfasser / Beitragende:
[Jaewook Lee, Yong-Joon Kim, Myung-Soo Kim, Gershon Elber]
Ort, Verlag, Jahr:
2015
Enthalten in:
The Visual Computer, 31/6-8(2015-06-01), 809-818
Format:
Artikel (online)
ID: 605540934
LEADER caa a22 4500
001 605540934
003 CHVBK
005 20210128100914.0
007 cr unu---uuuuu
008 210128e20150601xx s 000 0 eng
024 7 0 |a 10.1007/s00371-015-1093-z  |2 doi 
035 |a (NATIONALLICENCE)springer-10.1007/s00371-015-1093-z 
245 0 0 |a Comparison of three bounding regions with cubic convergence to planar freeform curves  |h [Elektronische Daten]  |c [Jaewook Lee, Yong-Joon Kim, Myung-Soo Kim, Gershon Elber] 
520 3 |a We compare the relative performance of bounding regions generated by three different curve-bounding methods with cubic convergence to planar freeform curves: spiral fat arcs (SFA)(Barton and Elber in Graph Models 73(2):50-57, 2011), bilens(Kumosenko in Comput Aided Geom Des 30(3):310-330, 2013), and bounding circular arcs (BCA)(Meek and Walton in J Comput Appl Math 59(2):221-231, 1995). For quantitative comparison, we consider three different criteria: geometric complexity (the number of circular arcs and line segments), construction time, and numerical stability. The BCA construction after one-step refinement (producing four circular arcs) is almost comparable to the other two methods in geometric complexity: the SFA with two circular arcs and two line segments, and the bilens with four circular arcs. In other comparison criteria, the BCA approach is more efficient and stable than the other two methods in producing a hierarchy of bounding regions that approximate a family of freeform planar curves within a given error bound. 
540 |a Springer-Verlag Berlin Heidelberg, 2015 
690 7 |a Planar freeform curves  |2 nationallicence 
690 7 |a Monotone spiral curve  |2 nationallicence 
690 7 |a Bounding circular arcs  |2 nationallicence 
690 7 |a Dynamic BVH  |2 nationallicence 
700 1 |a Lee  |D Jaewook  |u Department of Electrical and Computer Engineering, Seoul National University, 151-744, Seoul, Korea  |4 aut 
700 1 |a Kim  |D Yong-Joon  |u Computer Science Department, Technion, 32000, Haifa, Israel  |4 aut 
700 1 |a Kim  |D Myung-Soo  |u Department of Computer Science and Engineering, Seoul National University, 151-744, Seoul, Korea  |4 aut 
700 1 |a Elber  |D Gershon  |u Computer Science Department, Technion, 32000, Haifa, Israel  |4 aut 
773 0 |t The Visual Computer  |d Springer Berlin Heidelberg  |g 31/6-8(2015-06-01), 809-818  |x 0178-2789  |q 31:6-8<809  |1 2015  |2 31  |o 371 
856 4 0 |u https://doi.org/10.1007/s00371-015-1093-z  |q text/html  |z Onlinezugriff via DOI 
898 |a BK010053  |b XK010053  |c XK010000 
900 7 |a Metadata rights reserved  |b Springer special CC-BY-NC licence  |2 nationallicence 
908 |D 1  |a research-article  |2 jats 
949 |B NATIONALLICENCE  |F NATIONALLICENCE  |b NL-springer 
950 |B NATIONALLICENCE  |P 856  |E 40  |u https://doi.org/10.1007/s00371-015-1093-z  |q text/html  |z Onlinezugriff via DOI 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Lee  |D Jaewook  |u Department of Electrical and Computer Engineering, Seoul National University, 151-744, Seoul, Korea  |4 aut 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Kim  |D Yong-Joon  |u Computer Science Department, Technion, 32000, Haifa, Israel  |4 aut 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Kim  |D Myung-Soo  |u Department of Computer Science and Engineering, Seoul National University, 151-744, Seoul, Korea  |4 aut 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Elber  |D Gershon  |u Computer Science Department, Technion, 32000, Haifa, Israel  |4 aut 
950 |B NATIONALLICENCE  |P 773  |E 0-  |t The Visual Computer  |d Springer Berlin Heidelberg  |g 31/6-8(2015-06-01), 809-818  |x 0178-2789  |q 31:6-8<809  |1 2015  |2 31  |o 371