A complete and nonoverlapping tracing algorithm for closed loops
From MaRDI portal
The problem of tracing without overlapping a closed curve given implicitly by surface-surface intersection is studied. The technique presented here applies the rotation index for appropriate tracing continuously, without restoring to domain partitioning. The authors are also able to achieve the integration of the novel rotation index algorithm in a marching-based algorithm for ensuring complete continuous tracing [cf. \textit{S.T. Wu} and \textit{L. N. de Andrade}, ibid. 16, 249--268 (1999; Zbl 0933.68136)].
Recommendations
Cites work
- A marching method for parametric surface/surface intersection
- Differential geometry of intersection curves of two surfaces
- scientific article; zbMATH DE number 53146 (Why is no real title available?)
- scientific article; zbMATH DE number 192895 (Why is no real title available?)
- scientific article; zbMATH DE number 3511136 (Why is no real title available?)
- scientific article; zbMATH DE number 3571053 (Why is no real title available?)
- scientific article; zbMATH DE number 3063566 (Why is no real title available?)
- Improved test for closed loops in surface intersections
- Intersection of arbitrary surfaces
- Loop detection in surface patch intersections
- Marching along a regular surface/surface intersection with circular steps
- Marching along surface/surface intersection curves with an adaptive step length
- On determining start points for a surface/surface intersection algorithm
- Surface/surface intersection
- Tracing surface intersections
Cited in
(3)
This page was built for publication: A complete and nonoverlapping tracing algorithm for closed loops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2573873)