Relevant bibliographies by topics / Triangulation de Delaunay restreinte

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Triangulation de Delaunay restreinte'

Author: Grafiati
Published: 4 June 2021
Last updated: 11 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Triangulation de Delaunay restreinte.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Triangulation de Delaunay restreinte"

1

Cignoni, P., C. Montani, R. Perego, and R. Scopigno. "Parallel 3D Delaunay Triangulation." Computer Graphics Forum 12, no. 3 (1993): 129–42. http://dx.doi.org/10.1111/1467-8659.1230129.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Feng, Leman, Pierre Alliez, Laurent Busé, Hervé Delingette, and Mathieu Desbrun. "Curved optimal delaunay triangulation." ACM Transactions on Graphics 37, no. 4 (2018): 1–16. http://dx.doi.org/10.1145/3197517.3201358.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Meng, XianHai, JiGang Li, Qin Yang, Qiang Cai, and QiMing Chen. "Complex conforming Delaunay triangulation." Science China Information Sciences 53, no. 6 (2010): 1130–40. http://dx.doi.org/10.1007/s11432-010-0097-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kolingerová, Ivana, and Josef Kohout. "Optimistic parallel Delaunay triangulation." Visual Computer 18, no. 8 (2002): 511–29. http://dx.doi.org/10.1007/s00371-002-0173-z.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Boissonnat, Jean-Daniel, Ramsay Dyer, and Arijit Ghosh. "Delaunay Triangulation of Manifolds." Foundations of Computational Mathematics 18, no. 2 (2017): 399–431. http://dx.doi.org/10.1007/s10208-017-9344-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Grigis, Alain. "Triangulation de Delaunay et Triangulation des Tores." Geometriae Dedicata 143, no. 1 (2009): 81–88. http://dx.doi.org/10.1007/s10711-009-9374-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

DEVILLERS, OLIVIER. "THE DELAUNAY HIERARCHY." International Journal of Foundations of Computer Science 13, no. 02 (2002): 163–80. http://dx.doi.org/10.1142/s0129054102001035.

Full text
Abstract:
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small memory occupation and the possibility of fully dynamic insertions and deletions. The location structure is organized into several levels. The lowest level just consists of the triangulation, then each level contains the triangulation of a small sample of the level below. Point location is done by walking in a triangulation to determine the nearest neighbor of the query at that level, then the walk restarts from the neig
APA, Harvard, Vancouver, ISO, and other styles
8

LEE, SANGYOON, CHAN-IK PARK, and CHAN-MO PARK. "AN IMPROVED PARALLEL ALGORITHM FOR DELAUNAY TRIANGULATION ON DISTRIBUTED MEMORY PARALLEL COMPUTERS." Parallel Processing Letters 11, no. 02n03 (2001): 341–52. http://dx.doi.org/10.1142/s0129626401000634.

Full text
Abstract:
Delaunay triangulation has been much used in such applications as volume rendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulation is large computation time required to obtain the triangulation on an input points sets. This time can be reduced by using more than one processor, and several parallel algorithms for Delaunay triangulation have been proposed. In this paper, we propose an improved parallel algorithm for Delaunay triangulation, which partitions the bounding convex region of the input points set into a number of regions by using Delau
APA, Harvard, Vancouver, ISO, and other styles
9

Brédif, M., L. Caraffa, M. Yirci, and P. Memari. "PROVABLY CONSISTENT DISTRIBUTED DELAUNAY TRIANGULATION." ISPRS Annals of Photogrammetry, Remote Sensing and Spatial Information Sciences V-2-2020 (August 3, 2020): 195–202. http://dx.doi.org/10.5194/isprs-annals-v-2-2020-195-2020.

Full text
Abstract:
Abstract. This paper deals with the distributed computation of Delaunay triangulations of massive point sets, mainly motivated by the needs of a scalable out-of-core surface reconstruction workflow from massive urban LIDAR datasets. Such a data often corresponds to a huge point cloud represented through a set of tiles of relatively homogeneous point sizes. This will be the input of our algorithm which will naturally partition this data across multiple processing elements. The distributed computation and communication between processing elements is orchestrated efficiently through an uncentrali
APA, Harvard, Vancouver, ISO, and other styles
10

Abellanas, Manuel, Ferran Hurtado, and Pedro A. Ramos. "Structural tolerance and Delaunay triangulation." Information Processing Letters 71, no. 5-6 (1999): 221–27. http://dx.doi.org/10.1016/s0020-0190(99)00107-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Triangulation de Delaunay restreinte"

1

Pellerin, Jeanne. "Prise en compte de la complexité géométrique des modèles structuraux dans des méthodes de maillage fondées sur le diagramme de Voronoï." Phd thesis, Université de Lorraine, 2014. http://tel.archives-ouvertes.fr/tel-01005722.

Full text
Abstract:
Selon la méthode utilisée pour construire un modèle structural en trois dimensions et selon l'application à laquelle il est destiné, son maillage, en d'autres termes sa représentation informatique, doit être adapté afin de respecter des critères de type, de nombre et de qualité de ses éléments. Les méthodes de maillage développées dans d'autres domaines que la géomodélisation ne permettent pas de modifier le modèle d'entrée. Ceci est souhaitable en géomodélisation afin de mieux contrôler le nombre d'éléments du maillage et leur qualité. L'objectif de cette thèse est de développer des méthodes
APA, Harvard, Vancouver, ISO, and other styles
2

Lemaire, Christophe. "Triangulation de Delaunay et arbres multidimensionnels." Phd thesis, Ecole Nationale Supérieure des Mines de Saint-Etienne, 1997. http://tel.archives-ouvertes.fr/tel-00850521.

Full text
Abstract:
Les travaux effectués lors de cette thèse concernent principalement la triangulation de Delaunay. On montre que la complexité en moyenne - en termes de sites inachevés - du processus de fusion multidimensionnelle dans l'hypothèse de distribution quasi-uniforme dans un hypercube est linéaire en moyenne. Ce résultat général est appliqué au cas du plan et permet d'analyser de nouveaux algorithmes de triangulation de Delaunay plus performants que ceux connus à ce jour. Le principe sous-jacent est de diviser le domaine selon des arbres bidimensionnels (quadtree, 2d-tree, bucket-tree. . . ) puis de
APA, Harvard, Vancouver, ISO, and other styles
3

Borouchaki, Houman. "Graphe de connexion et triangulation de delaunay." Paris 7, 1993. http://www.theses.fr/1993PA077127.

Full text
Abstract:
Une methode generale est presentee pour determiner l'enveloppe convexe d'un ensemble fini de points dans r#d. Pour definir la structure faciale d'un d-polytope, un nouveau graphe, dit de connexion, est introduit; il permet d'eviter les tris effectues pour la mise a jour des relations d'adjacence a chaque etape d'insertion de point; en ce sens cette methode fournit un automate pour la resolution du probleme. Cette methode est appliquee a une construction de l'i-dag propose par boissonnat et al. Les deux algorithmes sont de complexite optimale, en temps d'execution, dans leur version randomisee.
APA, Harvard, Vancouver, ISO, and other styles
4

Pébay, Philippe. "Delaunay-admissibilité a priori en dimensions 2 et 3." Paris 6, 2000. http://www.theses.fr/2000PA066588.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sheehy, Damian James. "Medial surface computation using a domain Delaunay triangulation." Thesis, Queen's University Belfast, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.239226.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Pébay, Philippe. "Delaunay-admissiblité en dimensions 2 et 3." Phd thesis, Université Pierre et Marie Curie - Paris VI, 2000. http://tel.archives-ouvertes.fr/tel-00607168.

Full text
Abstract:
La méthode des éléments finis, largement utilisée en analyse numérique, requiert que le domaine considéré soit préalablement maillé, c'est-à-dire partitionné en un ensemble de polytopes généralement, mais pas nécessairement, simpliciaux. Parmi les méthodes permettant la génération de tels maillages, la triangulation de Delaunay présente le double intérêt d'avoir un support théorique fondant la robustesse des algorithmes, ainsi que de produire des éléments de qualité, conditionnant fortement la précision des calculs ultérieurs. Elle présente cependant l'inconvénient de ne pas être à même de pre
APA, Harvard, Vancouver, ISO, and other styles
7

Davoine, Franck. "Compression d'images par fractales basée sur la triangulation de Delaunay." Phd thesis, Grenoble INPG, 1995. http://tel.archives-ouvertes.fr/tel-00005042.

Full text
Abstract:
Ce mémoire traite de la compression des images fixes par fractales, fondée sur la théorie des systèmes de fonctions itérées (IFS). Après quelques rappels sur les principales méthodes de codage entropique et de compression réversible et irréversible des images nous introduisons les notions nécessaires à la compréhension de la théorie des IFS. Nous détaillons ensuite les principaux algorithmes de compression des images naturelles selon l'approche fractale. Ces derniers consistent à approximer chacun des éléments d'une partition à l'aide d'une transformation locale contractante appliquée sur une
APA, Harvard, Vancouver, ISO, and other styles
8

Razafindramanana, Octavio. "Low-dimensional data analysis and clustering by means of Delaunay triangulation." Thesis, Tours, 2014. http://www.theses.fr/2014TOUR4033/document.

Full text
Abstract:
Les travaux présentés et discutés dans cette thèse ont pour objectif de proposer plusieurs solutions au problème de l’analyse et du clustering de nuages de points en basse dimension. Ces solutions s’appuyent sur l’analyse de triangulations de Delaunay. Deux types d’approches sont présentés et discutés. Le premier type suit une approche en trois-passes classique: 1) la construction d’un graphe de proximité contenant une information topologique, 2) la construction d’une information statistique à partir de ce graphe et 3) la suppression d’éléments inutiles au regard de cette information statistiq
APA, Harvard, Vancouver, ISO, and other styles
9

Castro, Pedro Machado Manhães de. "Méthodes pour accélérer les triangulations de Delaunay." Nice, 2010. https://tel.archives-ouvertes.fr/tel-00531765.

Full text
Abstract:
Cette thèse propose de nouvelles méthodes pour accélérer certaines des plus importantes opérations dans une triangulation de Delaunay, conciliant efficacité et bonne complexité théorique. Nous proposons deux approches pour calculer la triangulation de Delaunay de points sur (ou proches) d’une sphère. La première approche calcule la triangulation de Delaunay de points exactement sur la sphère par construction. La deuxième approche calcule directement l’enveloppe convexe de l’ensemble d’entrée, et donne quelques garanties sur la sortie. Les deux approches sont basées sur la triangulation réguliè
APA, Harvard, Vancouver, ISO, and other styles
10

Santos, Filho José Borges dos. "Operador laplaciano discreto via triangulação de Delaunay intrínseca." Universidade Federal de Alagoas, 2008. http://repositorio.ufal.br/handle/riufal/1036.

Full text
Abstract:
The main goal of this work is to present a discrete analogous of the laplacian operator, that is, a linear operator on the set of piecewise linear functions over a triangular mesh that has similar properties to the continuous laplacian over a surface. Particularly, we will show that if the mesh satisfies a Delaunay criterion, the laplacian obeys a discrete version of the maximum principle, which importance in the discrete setting is similar to the importance of the maximum principle in the theory of harmonic functions. We also present three applications of the discrete laplacian: the first one
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Triangulation de Delaunay restreinte"

1

Skvortsov, Alexey V. Delaunay triangulation and its applications. Tomsk state university, 2002. http://dx.doi.org/10.17273/book.2002.1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Mavriplis, Dimitri J. An advancing front Delaunay triangulation algorithm designed for robustness. Institute for Computer Applications in Science and Engineering, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mavriplis, Dimitri J. Adaptive mesh generation for viscous flows using Delaunay triangulation. ICASE, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Driscoll, Tobin A. Numerical conformal mapping using cross-ratios and Delaunay triangulation. Cornell Theory Center, Cornell University, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Krause, Jens. On boundary conforming anisotropic Delaunay meshes. Hartung-Gorre, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

George, Paul-Louis. Delaunay Triangulation & Meshing. John Wiley & Sons Inc, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

M, Mount D., and Langley Research Center, eds. Delaunay triangulation and computational fluid dynamics meshes. National Aeronautics and Space Administration, Langley Research Center, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

M, Mount D., and Langley Research Center, eds. Delaunay triangulation and computational fluid dynamics meshes. National Aeronautics and Space Administration, Langley Research Center, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

M, Mount D., and Langley Research Center, eds. Delaunay triangulation and computational fluid dynamics meshes. National Aeronautics and Space Administration, Langley Research Center, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Center, Ames Research, ed. Parallel implementation of an algorithm for Delaunay triangulation. National Aeronautics and Space Administration, Ames Research Center, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Triangulation de Delaunay restreinte"

1

Shekhar, Shashi, and Hui Xiong. "Delaunay Triangulation." In Encyclopedia of GIS. Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-35973-1_278.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ito, Yasushi. "Delaunay Triangulation." In Encyclopedia of Applied and Computational Mathematics. Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-540-70529-1_314.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dinas, Simena, and Hector J. Martínez. "Delaunay Triangulation." In Encyclopedia of Computer Graphics and Games. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-319-08234-9_393-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Gass, Saul I., and Carl M. Harris. "Delaunay triangulation." In Encyclopedia of Operations Research and Management Science. Springer US, 2001. http://dx.doi.org/10.1007/1-4020-0611-x_227.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sußner, Gerd, and Günther Greiner. "Hexagonal Delaunay Triangulation." In Proceedings of the 18th International Meshing Roundtable. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04319-2_30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Yang, Yi-Jun, Hui Zhang, Jun-Hai Yong, Wei Zeng, Jean-Claude Paul, and Jiaguang Sun. "Constrained Delaunay Triangulation Using Delaunay Visibility." In Advances in Visual Computing. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11919476_68.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Araújo, Filipe, and Luís Rodrigues. "Fast Localized Delaunay Triangulation." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11516798_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Cheng, Siu-Wing. "3D Conforming Delaunay Triangulation." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_716.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Cheng, Siu-Wing. "3D Conforming Delaunay Triangulation." In Encyclopedia of Algorithms. Springer US, 2014. http://dx.doi.org/10.1007/978-3-642-27848-8_716-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ye, Shu, and Karen Daniels. "Hierarchical Delaunay Triangulation for Meshing." In Experimental Algorithms. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20662-7_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Triangulation de Delaunay restreinte"

1

Hammersley, Richard, and Hong-Qian (Karen) Lu. "Decremental Delaunay triangulation." In ACM SIGGRAPH 99 Conference abstracts and applications. ACM Press, 1999. http://dx.doi.org/10.1145/311625.312128.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Liu, Xin, Jon G. Rokne, and Marina L. Gavrilova. "Smooth Morphing Delaunay Triangulation." In 2010 International Symposium on Voronoi Diagrams in Science and Engineering (ISVD). IEEE, 2010. http://dx.doi.org/10.1109/isvd.2010.25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Pennisi, A., D. D. Bloisi, D. Nardi, A. R. Giampetruzzi, C. Mondino, and A. Facchiano. "Melanoma Detection Using Delaunay Triangulation." In 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, 2015. http://dx.doi.org/10.1109/ictai.2015.117.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Guan, Zixiao, Baihai Zhang, Yu Zhang, Shi Zhang, and Feifan Wang. "Delaunay triangulation based localization scheme." In 2017 29th Chinese Control And Decision Conference (CCDC). IEEE, 2017. http://dx.doi.org/10.1109/ccdc.2017.7978958.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Musin, Oleg R. "Properties of the Delaunay triangulation." In the thirteenth annual symposium. ACM Press, 1997. http://dx.doi.org/10.1145/262839.263061.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Devillers, Olivier. "Improved incremental randomized Delaunay triangulation." In the fourteenth annual symposium. ACM Press, 1998. http://dx.doi.org/10.1145/276884.276896.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Chengfeng Wang. "Delaunay Triangulation Algorithm for Fingerprint Matching." In 2006 3rd International Symposium on Voronoi Diagrams in Science and Engineering. IEEE, 2006. http://dx.doi.org/10.1109/isvd.2006.19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sintunata, Vicky, and Terumasa Aoki. "Grey-scale skeletonization using Delaunay triangulation." In 2017 IEEE International Conference on Consumer Electronics - Taiwan (ICCE-TW). IEEE, 2017. http://dx.doi.org/10.1109/icce-china.2017.7990993.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Razafindramanana, Octavio, Frederic Rayar, and Gilles Venturini. "Incremental Delaunay Triangulation Construction for Clustering." In 2014 22nd International Conference on Pattern Recognition (ICPR). IEEE, 2014. http://dx.doi.org/10.1109/icpr.2014.242.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Lee, Dong-Young, and Simon S. Lam. "Protocol Design for Dynamic Delaunay Triangulation." In 27th International Conference on Distributed Computing Systems (ICDCS '07). IEEE, 2007. http://dx.doi.org/10.1109/icdcs.2007.130.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Triangulation de Delaunay restreinte"

1

Hardwick, Jonathan C. Implementation and Evaluation of an Efficient 2D Parallel Delaunay Triangulation Algorithm,. Defense Technical Information Center, 1997. http://dx.doi.org/10.21236/ada328005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Triangulation de Delaunay restreinte' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography