Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Laurent Rineau"'
Publikováno v:
Computer Graphics Forum
Computer Graphics Forum, 2021, Proceedings of the EUROGRAPHICS Symposium on Geometry Processing 2021, 40 (5), pp.125-142. ⟨10.1111/cgf.14362⟩
Computer Graphics Forum, Wiley, 2021, Proceedings of the EUROGRAPHICS Symposium on Geometry Processing 2021, 40 (5), pp.125-142. ⟨10.1111/cgf.14362⟩
Computer Graphics Forum, 2021, Proceedings of the EUROGRAPHICS Symposium on Geometry Processing 2021, 40 (5), pp.125-142. ⟨10.1111/cgf.14362⟩
Computer Graphics Forum, Wiley, 2021, Proceedings of the EUROGRAPHICS Symposium on Geometry Processing 2021, 40 (5), pp.125-142. ⟨10.1111/cgf.14362⟩
International audience; CAD models represented by NURBS surface patches are often hampered with defects due to inaccurate representations of trimming curves. Such defects make these models unsuitable to the direct generation of valid volume meshes, a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa8ad325f33b84846989be29e7f6310f
https://inria.hal.science/hal-03276860/document
https://inria.hal.science/hal-03276860/document
Publikováno v:
Engineering with Computers
Engineering with Computers, 2010, 26, pp.265-279
Engineering with Computers, 2010, 26, pp.265-279
International audience; This paper introduces a three-dimensional mesh generation al- gorithm for domains whose boundaries are curved surfaces, possibly with sharp features. The algorithm combines a Delaunay-based surface mesher with a Ruppert-like v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::376d0e6d1972593b7fff46cc2446970b
https://doi.org/10.1007/s00366-009-0166-x
https://doi.org/10.1007/s00366-009-0166-x
Autor:
Mariette Yvinec, Laurent Rineau
Publikováno v:
Proceedings of the 16th International Meshing Roundtable ISBN: 9783540751021
IMR
IMR
This paper proposes an algorithm to mesh 3D domains bounded by piecewise smooth surfaces. The algorithm may handle multivolume domains defined by non connected or non manifold surfaces.The boundary and subdivision surfaces are assumed to be described
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::98f81dc5ab0246c14a045ae1d8459515
https://doi.org/10.1007/978-3-540-75103-8_25
https://doi.org/10.1007/978-3-540-75103-8_25
Autor:
Jean-Daniel Boissonnat, Florent Ségonne, Laurent Rineau, Mariette Yvinec, Renaud Keriven, Jean-Philippe Pons
Publikováno v:
Proceedings of the 20th International Conference on Information processing in Medical Imaging 2007
International Conference on Information Processing in Medical Imaging 2007
International Conference on Information Processing in Medical Imaging 2007, 2007, Netherlands. pp.200
Lecture Notes in Computer Science ISBN: 9783540732723
IPMI
International Conference on Information Processing in Medical Imaging 2007
International Conference on Information Processing in Medical Imaging 2007, 2007, Netherlands. pp.200
Lecture Notes in Computer Science ISBN: 9783540732723
IPMI
International audience; Inthispaper,weextendsomerecentprovablycorrectDelaunay-based meshing algorithms to the case of multi-label partitions, so that they can be applied to the generation of high-quality geometric models from labeled med- ical datase
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::31fdec006b204b2fee5b0c1ac24e4b64
https://hal.archives-ouvertes.fr/hal-00488043
https://hal.archives-ouvertes.fr/hal-00488043
Publikováno v:
[Research Report] RR-5626, INRIA. 2006, pp.21
International Meshing Roundtable
International Meshing Roundtable, 2005, San Diego, Californie, USA
Proceedings of the 14th International Meshing Roundtable ISBN: 3540251375
IMR
International Meshing Roundtable
International Meshing Roundtable, 2005, San Diego, Californie, USA
Proceedings of the 14th International Meshing Roundtable ISBN: 3540251375
IMR
This paper introduces a three-dimensional mesh generation algorithm for domains bounded by smooth surfaces. The method combines a surface mesher with a volume mesher, both based on Delaunay refinement, to get a greedy algorithm that samples the inter
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4220ab9d15236a6236a0ecd1e21e9b08
https://inria.hal.science/inria-00070382
https://inria.hal.science/inria-00070382
Autor:
Laurent Rineau, Mariette Yvinec
Publikováno v:
Computational Geometry. (1-2):100-110
This paper describes a generic software designed to implement meshing algorithms based on the Delaunay refinement paradigm. Such a meshing algorithm is generally described through a set of rules guiding the refinement of mesh elements. The central it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::28d080490c7c628fa0bca1e9ef85405f