An exact and efficient approach for computing a cell in an arrangement of quadrics (Q2575587)

From MaRDI portal
scientific article
Language Label Description Also known as
English
An exact and efficient approach for computing a cell in an arrangement of quadrics
scientific article

    Statements

    An exact and efficient approach for computing a cell in an arrangement of quadrics (English)
    0 references
    0 references
    0 references
    5 December 2005
    0 references
    The method for computing the mathematical correct topology of a 3-dimensional connected region (cell) in an arrangement of quadrics surfaces is presented in the article. The suggested method uses exact algebraic computation and provides the correct mathematical result in every case, even in a degenerated one. The solution is based on transformation of the spatial problem to the planar one by projection. For each quadric surface of arrangement, all its intersection curves with the other quadrics as well as its silhouette are projected into the plane. The main contribution of the suggested method is the determination of all event points in resulting planar arrangement, including tangential intersections and singular points. The determination of nonsingular tangential intersection by introducing an auxiliary curve (so called Jacobi curve) is described, too. Results obtained in this work can be useful in many areas of computer science.
    0 references
    0 references
    Solid modelling
    0 references
    computational geometry
    0 references
    algebraic geometry
    0 references
    quadric surface
    0 references
    intersection
    0 references
    tangential intersection
    0 references
    Jacobi curve
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references