Complete and non - overlapping marching along a closed regular intersection curve ? Wu , Shin - Ting
نویسنده
چکیده
In this paper we present an algorithm for estimating the rotation index of a closed regular intersection curve from its singular points. On the basis of this index we have also devised a procedure that guarantees that a closed intersection curve will be traced completely, without overlapping. Combining this procedure with marching steps derived from differential geometric properties has resulted in a robust intersection technique.
منابع مشابه
Complete and non-overlapping marching along a closed regular intersection curve
In this paper we present an algorithm for estimating the rotation index of a closed regular intersection curve from its singular points. On the basis of this index we have also devised a procedure that guarantees that a closed intersection curve will be traced completely, without overlapping. Combining this procedure with marching steps derived from differential geometric properties has resulte...
متن کاملOn Estimating Local Geometric Properties of Intersection Curves
This paper presents a simple and robust algorithm for estimating the local geometric properties of intersection curves, namely the tangent, normal, binormal, curvature and torsion vectors at any point. In addition, two new marching directions that make use of these properties are given.
متن کاملTracing along an Intersection Closed Loop, When Should One Stop?
In this paper we present an algorithm for estimating the rotation index of a closed loop from the number of singular points on it. On the basis of this index we also devise a procedure that guarantees to have an arbitrary loop being traced only once. Combining this procedure with a higher-order stepping algorithm, a robust intersection technique is resulted.
متن کاملOther marching direction of third order
The main motivation of this work is the problem of compute intersection curve between two surface. The surface/surface intersection, is a fundamental problem in computational geometry and geometric modelling of complex shapes. In general surface intersections, the most commonly used methods include subdivision and marching. Marching-based algorithms begin by finding a starting point on the inte...
متن کاملExtraction of Intersection curves from Iso-surfaces on co-located 3D grids
This paper presents new methods for efficient extraction of intersection curves between iso-surfaces of any pair of co-located 3D scalar fields. The first method is based on the Marching Cubes algorithm which has been enhanced to produce an additional data structure that makes it possible to reduce the complexity of the general surface intersection extraction from O(N) to O( √ N), where N denot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001