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

Abstract

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][222][223][224][225][226][227][228][229][230][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.

Efficient Minimum Distance Computation for Solids of Revolution

“…The higher-order convergence to a univariate curve (i.e., the profile curve), not directly to a bivariate surface, is the main source for the outperformance of our approach in the data reduction. (See [Lee et al (2015b)] for comparisons among bounding For each pair of static solid models in Figure 7, we have also computed the minimum distances between the two models at 50,000 different frames taken from their continuous motion. Figure 11 shows some snapshots of the test for the pairs of (table, lightmil) and (pawn, bottle) models.…”

Editorial

“…Two other papers by Biswas et al [4] and Sa et al [5] focus on the topic of 3D modeling with an application in 3D printing. The three last papers by Lee et al [6], Bohl et al [7] and Paulus et al [8] are about the performance analysis of bounding regions, the modeling of 3D fruits and the virtual cutting of deformable objects.…”