# Conversion CSG-BRep de scènes définies par des quadriques

1 VEGAS - Effective Geometric Algorithms for Surfaces and Visibility
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : The objective of this thesis is to investigate the problem of boundary evaluation for scenes defined by quadrics. This algorithm consists of four steps : (i) the parameterization of every intersection curve between quadrics ; (ii) the calculation of the intersection points between such curves and the quadrics ; (iii) the determination, among the resulting arcs of curves of those that limit a face of the BRep model; (iv) the identification of the arcs that delimit a singe face, and their assembling into chains of arcs ; some faces might contain <>, and thus may be limited by several chains of arcs. The first two steps were solved using two algorithms from the litterature. The two remaining steps were solved by introducing new algorithms : VE (Visible Edges) and CA (Chains Assembling) respectively. Our algorithm of boundary evaluation is robust in the sense that all degenerate configurations are considered in the paradigm of exact geometric computing. Il solves entirely the problem for scenes defined by quadrics. Its time-complexity id $O(n^4)$ in the worst case, where $n$ is the number of quadrics. A partial implementation was developed and preliminary experimental results were obtained.
Keywords :
Document type :
Theses
Domain :

Cited literature [59 references]

https://tel.archives-ouvertes.fr/tel-00540015
Contributor : Maria Pentcheva <>
Submitted on : Tuesday, July 12, 2011 - 11:12:15 AM
Last modification on : Monday, April 16, 2018 - 10:42:04 AM
Long-term archiving on : Thursday, October 13, 2011 - 2:25:27 AM

### Identifiers

• HAL Id : tel-00540015, version 2

### Citation

Maria Pentcheva. Conversion CSG-BRep de scènes définies par des quadriques. Informatique [cs]. Université Nancy II, 2010. Français. ⟨tel-00540015v2⟩

Record views