1996
DOI: 10.1016/0010-4485(95)00063-1
|View full text |Cite
|
Sign up to set email alerts
|

Robust interval algorithm for curve intersections

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
18
0

Year Published

1999
1999
2002
2002

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 53 publications
(18 citation statements)
references
References 14 publications
0
18
0
Order By: Relevance
“…Pick points We shall see in the next section that such a solid can be constructed using interval surface intersection algorithms [14,15]. Preliminary to this construction is the following set of conditions on B and V (see Fig.…”
Section: Now Let V ⊂ Rmentioning
confidence: 99%
See 2 more Smart Citations
“…Pick points We shall see in the next section that such a solid can be constructed using interval surface intersection algorithms [14,15]. Preliminary to this construction is the following set of conditions on B and V (see Fig.…”
Section: Now Let V ⊂ Rmentioning
confidence: 99%
“…The required curve and surface intersection algorithms using interval arithmetic were presented in [14,15]. However, topological issues involved in interval solid modeling were not studied in these papers [10,11,14,15]. As an interval boundary model defines a family of infinitely many boundaries, maintaining topological invariance of such boundaries is, by no means, a trivial problem.…”
Section: Introductionmentioning
confidence: 97%
See 1 more Smart Citation
“…These systems will frequently fail as a result of the limited precision of geometrically crucial computations, which is inherent to the internal representation of floating point numbers. In our approach, we employ a new representation scheme based on interval parametric curves and surfaces [20][21][22][23]28] implemented in rounded interval arithmetic (RIA) [1,30] which ensures numerical robustness and provides results with verifiable numeric certainty. For example, we have developed a robust interval Delaunay test [9] to overcome serious problems such as degeneracy, nonconformance, and topologically invalid triangulations in the conventional Bowyer-Watson algorithm operating in FPA.…”
Section: Introductionmentioning
confidence: 99%
“…A subdivision based approach, using the Berstein-B ezier basis functions, has been used in implementing the examples shown in this paper 5,6,12]. The basic approach is similar to conventional techniques in computing the solutions of multivariate equations 17,21,25] …”
Section: Intersecting Two Ringed Surfacesmentioning
confidence: 99%