Relevant bibliographies by topics / Delaunay graph

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Delaunay graph'

Author: Grafiati
Published: 4 June 2021
Last updated: 7 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 'Delaunay graph.'

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 "Delaunay graph"

1

KAPOOR, SANJIV, and XIANG-YANG LI. "PROXIMITY STRUCTURES FOR GEOMETRIC GRAPHS." International Journal of Computational Geometry & Applications 20, no. 04 (2010): 415–29. http://dx.doi.org/10.1142/s0218195910003360.

Full text
Abstract:
In this paper we study proximity graph structures like Delaunay triangulations based on geometric graphs, i.e. graphs which are subgraphs of the complete geometric graph. Given an arbitrary geometric graph G, we define Voronoi diagrams, Delaunay triangulations, relative neighborhood graphs, Gabriel graphs which are related to the graph structure and then study their complexities when G is a general geometric graph or G is some special graph derived from the application area of wireless networks. Besides being of fundamental interest these structures have applications in topology control for wi
APA, Harvard, Vancouver, ISO, and other styles
2

ABELLANAS, MANUEL, PROSENJIT BOSE, JESÚS GARCÍA, FERRAN HURTADO, CARLOS M. NICOLÁS, and PEDRO RAMOS. "ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS." International Journal of Computational Geometry & Applications 19, no. 06 (2009): 595–615. http://dx.doi.org/10.1142/s0218195909003143.

Full text
Abstract:
Given a set P of n points in the plane, the order-k Delaunay graph is a graph with vertex set P and an edge exists between two points p, q ∈ P when there is a circle through p and q with at most k other points of P in its interior. We provide upper and lower bounds on the number of edges in an order-k Delaunay graph. We study the combinatorial structure of the set of triangulations that can be constructed with edges of this graph. Furthermore, we show that the order-k Delaunay graph is connected under the flip operation when k ≤ 1 but not necessarily connected for other values of k. If P is in
APA, Harvard, Vancouver, ISO, and other styles
3

WANG, YIBIN, NING QIN, and NING ZHAO. "FAST DYNAMIC MESHING METHOD BASED ON DELAUNAY GRAPH AND INVERSE DISTANCE WEIGHTING INTERPOLATION." International Journal of Modern Physics: Conference Series 42 (January 2016): 1660166. http://dx.doi.org/10.1142/s2010194516601666.

Full text
Abstract:
A novel mesh deformation technique is developed based on the Delaunay graph mapping method and the inverse distance weighting (IDW) interpolation. The algorithm maintains the advantages of the efficiency of Delaunay-graph-mapping mesh deformation while possess the ability for better controlling the near surface mesh quality. The Delaunay graph is used to divide the mesh domain into a number of sub-domains. On each of the sub-domains, the inverse distance weighting interpolation is applied to build a much smaller sized translation matrix between the original mesh and the deformed mesh, resultin
APA, Harvard, Vancouver, ISO, and other styles
4

KHOPKAR, ABHIJEET, and SATHISH GOVINDARAJAN. "HARDNESS RESULTS FOR COMPUTING OPTIMAL LOCALLY GABRIEL GRAPHS." International Journal of Computational Geometry & Applications 24, no. 02 (2014): 153–71. http://dx.doi.org/10.1142/s0218195914500071.

Full text
Abstract:
Delaunay and Gabriel graphs are widely studied geometric proximity structures. Motivated by applications in wireless routing, relaxed versions of these graphs known as Locally Delaunay Graphs (LDGs) and Locally Gabriel Graphs (LGGs) were proposed. We propose another generalization of LGGs called Generalized Locally Gabriel Graphs (GLGGs) in the context when certain edges are forbidden in the graph. Unlike a Gabriel Graph, there is no unique LGG or GLGG for a given point set because no edge is necessarily included or excluded. This property allows us to choose an LGG/GLGG that optimizes a param
APA, Harvard, Vancouver, ISO, and other styles
5

Wang, Yibin, Ning Qin, and Ning Zhao. "Delaunay Graph Based Inverse Distance Weighting for Fast Dynamic Meshing." Communications in Computational Physics 21, no. 5 (2017): 1282–309. http://dx.doi.org/10.4208/cicp.oa-2016-0085.

Full text
Abstract:
AbstractA novel mesh deformation technique is developed based on the Delaunay graph mapping method and the inverse distance weighting (IDW) interpolation. The algorithm maintains the advantages of the efficiency of Delaunay graph mapping mesh deformation while it also possesses the ability of better controlling the near surface mesh quality. The Delaunay graph is used to divide the mesh domain into a number of sub-domains. On each sub-domain, the inverse distance weighting interpolation is applied, resulting in a similar efficiency as compared to the fast Delaunay graph mapping method. The pap
APA, Harvard, Vancouver, ISO, and other styles
6

Ding, Li, Tongqing Guo, and Zhiliang Lu. "A Hybrid Method for Dynamic Mesh Generation Based on Radial Basis Functions and Delaunay Graph Mapping." Advances in Applied Mathematics and Mechanics 7, no. 3 (2015): 338–56. http://dx.doi.org/10.4208/aamm.2014.m614.

Full text
Abstract:
AbstractAiming at complex configuration and large deformation, an efficient hybrid method for dynamic mesh generation is presented in this paper, which is based on Radial Basis Functions (RBFs) and Delaunay graph mapping. Based on the computational mesh, a set of very coarse grid named as background grid is generated firstly, and then the computational mesh can be located at the background grid by Delaunay graph mapping technique. After that, the RBFs method is applied to deform the background grid by choosing partial mesh points on the boundary as the control points. Finally, Delaunay graph m
APA, Harvard, Vancouver, ISO, and other styles
7

Biniaz, Ahmad, Anil Maheshwari, and Michiel Smid. "Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties." Computational Geometry 48, no. 9 (2015): 646–60. http://dx.doi.org/10.1016/j.comgeo.2015.07.003.

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

BOSE, PROSENJIT, VIDA DUJMOVIĆ, FERRAN HURTADO та ін. "PROXIMITY GRAPHS: E, δ, Δ, χ AND ω". International Journal of Computational Geometry & Applications 22, № 05 (2012): 439–69. http://dx.doi.org/10.1142/s0218195912500112.

Full text
Abstract:
Graph-theoretic properties of certain proximity graphs defined on planar point sets are investigated. We first consider some of the most common proximity graphs of the family of the Delaunay graph, and study their number of edges, minimum and maximum degree, clique number, and chromatic number. In the second part of the paper we focus on the higher order versions of some of these graphs and give bounds on the same parameters.
APA, Harvard, Vancouver, ISO, and other styles
9

Satyanarayana, D., and S. V. Rao. "Constrained Delaunay Triangulation for Ad Hoc Networks." Journal of Computer Systems, Networks, and Communications 2008 (2008): 1–10. http://dx.doi.org/10.1155/2008/160453.

Full text
Abstract:
Geometric spanners can be used for efficient routing in wireless ad hoc networks. Computation of existing spanners for ad hoc networks primarily focused on geometric properties without considering network requirements. In this paper, we propose a new spanner called constrained Delaunay triangulation (CDT) which considers both geometric properties and network requirements. The CDT is formed by introducing a small set of constraint edges into local Delaunay triangulation (LDel) to reduce the number of hops between nodes in the network graph. We have simulated the CDT using network simulator (ns-
APA, Harvard, Vancouver, ISO, and other styles
10

Baccelli, F., K. Tchoumatchenko, and S. Zuyev. "Markov paths on the Poisson-Delaunay graph with applications to routeing in mobile networks." Advances in Applied Probability 32, no. 01 (2000): 1–18. http://dx.doi.org/10.1017/s0001867800009733.

Full text
Abstract:
Consider the Delaunay graph and the Voronoi tessellation constructed with respect to a Poisson point process. The sequence of nuclei of the Voronoi cells that are crossed by a line defines a path on the Delaunay graph. We show that the evolution of this path is governed by a Markov chain. We study the ergodic properties of the chain and find its stationary distribution. As a corollary, we obtain the ratio of the mean path length to the Euclidean distance between the end points, and hence a bound for the mean asymptotic length of the shortest path. We apply these results to define a family of s
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Delaunay graph"

1

Cano, Vila María del Pilar. "Generalized Delaunay triangulations : graph-theoretic properties and algorithms." Doctoral thesis, Universitat Politècnica de Catalunya, 2020. http://hdl.handle.net/10803/669310.

Full text
Abstract:
This thesis studies different generalizations of Delaunay triangulations, both from a combinatorial and algorithmic point of view. The Delaunay triangulation of a point set S, denoted DT(S), has vertex set S. An edge uv is in DT(S) if it satisfies the empty circle property: there exists a circle with u and v on its boundary that does not enclose points of S. Due to different optimization criteria, many generalizations of the DT(S) have been proposed. Several properties are known for DT(S), yet, few are known for its generalizations. The main question we explore is: to what extent can propertie
APA, Harvard, Vancouver, ISO, and other styles
2

Anders, Karl-Heinrich. "Parameterfreies hierarchisches Graph-Clustering-Verfahren zur Interpretation raumbezogener Daten." [S.l. : s.n.], 2004. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB11482108.

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

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
4

Shokrieh, Farbod. "Divisors on graphs, binomial and monomial ideals, and cellular resolutions." Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/52176.

Full text
Abstract:
We study various binomial and monomial ideals arising in the theory of divisors, orientations, and matroids on graphs. We use ideas from potential theory on graphs and from the theory of Delaunay decompositions for lattices to describe their minimal polyhedral cellular free resolutions. We show that the resolutions of all these ideals are closely related and that their Z-graded Betti tables coincide. As corollaries, we give conceptual proofs of conjectures and questions posed by Postnikov and Shapiro, by Manjunath and Sturmfels, and by Perkinson, Perlman, and Wilmes. Various other results rela
APA, Harvard, Vancouver, ISO, and other styles
5

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
6

Robbeloth, Michael Christopher. "Recognition of Incomplete Objects based on Synthesis of Views Using a Geometric Based Local-Global Graphs." Wright State University / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=wright1557509373174391.

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

Moreau, Jean Michel. "Hiérarchisation et facettisation de la représentation par segments d'un graphe planaire." Phd thesis, Ecole Nationale Supérieure des Mines de Saint-Etienne, 1990. http://tel.archives-ouvertes.fr/tel-00831581.

Full text
Abstract:
L'organisation structurée (graphe avec hiérarchies et propriétés sémantiques) d'objets du plan implique plusieurs opérations complexes qui doivent être effectuées en toute sécurité de cohérence topologique. La précision inhérente d'une machine étant nécessairement limitée, il faut souvent recourir à une arithmétique exacte couteuse. Cette thèse présente, à partir de travaux liés à la réalisation du module de facettisation d'un simulateur de vol industriel, une solution permettant l'utilisation d'une arithmétique mixte, de précision arbitraire et de coût très inférieur statistiquement a la solu
APA, Harvard, Vancouver, ISO, and other styles
8

Gaillard, Pierre. "Apprentissage statistique de la connexité d'un nuage de points par modèle génératif : application à l'analyse exploratoire et la classification semi-supervisée." Compiègne, 2008. http://www.theses.fr/2008COMP1767.

Full text
Abstract:
Dans cette thèse, nous présentons un modèle statistique permettant d'extraire la connexité des variétés structurantes d'un ensemble de points. Ce modèle combine des approches statistiques et géométriques en définissant un modèle de mélange gaussien construit à partir d'un graphe. A partir de ce graphe génératif, nous proposons et évaluons des méthodes d'analyses exploratoires et de classification non-supervisée et semi-supervisée<br>In this work, we propose a statistical model to learn the connectedness of a set of points. This model combine geometrical and statistical approaches by defining a
APA, Harvard, Vancouver, ISO, and other styles
9

Colin, de Verdière Eric. "Raccourcissement de courbes et décomposition de surfaces." Paris 7, 2003. http://www.theses.fr/2003PA077147.

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

Karaman, Svebor. "Indexation de la Vidéo Portée : Application à l'Étude Épidémiologique des Maladies Liées à l'Âge." Phd thesis, Université Sciences et Technologies - Bordeaux I, 2011. http://tel.archives-ouvertes.fr/tel-00689855.

Full text
Abstract:
Le travail de recherche de cette thèse de doctorat s'inscrit dans le cadre du suivi médical des patients atteints de démences liées à l'âge à l'aide des caméras videos portées par les patients. L'idée est de fournir aux médecins un nouvel outil pour le diagnostic précoce de démences liées à l'âge telles que la maladie d'Alzheimer. Plus précisément, les Activités Instrumentales du Quotidien (IADL : Instrumental Activities of Daily Living en anglais) doivent être indexées automatiquement dans les vidéos enregistrées par un dispositif d'enregistrement portable. Ces vidéos présentent des caractéri
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Delaunay graph"

1

Shin, Dongjoe, and Tardi Tjahjadi. "Similarity Invariant Delaunay Graph Matching." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-89689-0_7.

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

Sarkar, Rik. "Low Distortion Delaunay Embedding of Trees in Hyperbolic Plane." In Graph Drawing. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-25878-7_34.

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

Biniaz, Ahmad, Anil Maheshwari, and Michiel Smid. "Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties." In Algorithms and Discrete Applied Mathematics. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-14974-5_9.

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

Cruz, Isabel F., and Donald I. Lambe. "Implementation of an Efficient Constraint Solver for the Layout of Graphs in Delaunay." In Graph Drawing. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-37623-2_35.

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

Abam, Mohammad Ali, Zahed Rahmati, and Alireza Zarei. "Kinetic Pie Delaunay Graph and Its Applications." In Algorithm Theory – SWAT 2012. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31155-0_5.

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

Bonichon, Nicolas, Cyril Gavoille, Nicolas Hanusse, and David Ilcinkas. "Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces." In Graph Theoretic Concepts in Computer Science. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16926-7_25.

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

Jacob, Riko, Stephan Ritscher, Christian Scheideler, and Stefan Schmid. "A Self-stabilizing and Local Delaunay Graph Construction." In Algorithms and Computation. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10631-6_78.

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

Keil, J. Mark, and Carl A. Gutwin. "The Delaunay triangulation closely approximates the complete Euclidean graph." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/3-540-51542-9_6.

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

Bose, Prosenjit, Paz Carmi, Michiel Smid, and Daming Xu. "Communication-Efficient Construction of the Plane Localized Delaunay Graph." In LATIN 2010: Theoretical Informatics. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12200-2_26.

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

Anton, François. "A Certified Delaunay Graph Conflict Locator for Semi-algebraic Sets." In Computational Science and Its Applications – ICCSA 2005. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11424758_70.

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

Conference papers on the topic "Delaunay graph"

1

Wei, Zhenhua, and Xiaoyuan Yan. "The Description of Delaunay Triangulated Graph." In Advanced Information Technology and Sensor Application 2014. Science & Engineering Research Support soCiety, 2014. http://dx.doi.org/10.14257/astl.2014.53.101.

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

Boissonnat, Jean-Daniel, Olivier Devillers, and Samuel Hornus. "Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension." In the 25th annual symposium. ACM Press, 2009. http://dx.doi.org/10.1145/1542362.1542403.

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

Emiris, Ioannis Z., Elias P. Tsigaridas, and George M. Tzoumas. "Exact Delaunay graph of smooth convex pseudo-circles." In 2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling. ACM Press, 2009. http://dx.doi.org/10.1145/1629255.1629282.

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

Davide, Passaniti, Lutfillohonov Shahrullohon, and Joonho Kwon. "Realistic Indoor Trajectory Generation Based on Delaunay Graph." In 2021 IEEE International Conference on Big Data and Smart Computing (BigComp). IEEE, 2021. http://dx.doi.org/10.1109/bigcomp51126.2021.00042.

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

Vajapeyam, Sridhar, and Michael Keefe. "Triangulated Surface Construction From Scattered 3-D Points." In ASME 1992 International Computers in Engineering Conference and Exposition. American Society of Mechanical Engineers, 1992. http://dx.doi.org/10.1115/cie1992-0087.

Full text
Abstract:
Abstract A three-dimensional analog to the Gabriel Graph structure is defined and an algorithmic procedure for the construction of a triangulated surface from scattered data points in three dimensions is developed based on the concept on three-dimensional Gabriel Graphs. The algorithm does not require the points to be in the form of a grid or on contours. The closest point 3-D Delaunay triangulation of the points is first constructed and the Delaunay triangles that satisfy the Gabriel Graph criterion are identified. From this set of triangles, extraneous triangles are removed, resulting in a t
APA, Harvard, Vancouver, ISO, and other styles
6

Dong, Hui-ying, Shuo Duan, and Yu Zhao. "Delaunay Graph Based Path Planning Method for Mobile Robot." In 2010 International Conference on Communications and Mobile Computing (CMC). IEEE, 2010. http://dx.doi.org/10.1109/cmc.2010.225.

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

Chen, Yuxi, Pedro Quelhas, and Aurelio Campilho. "Low frame rate cell tracking: A Delaunay graph matching approach." In 2011 8th IEEE International Symposium on Biomedical Imaging (ISBI 2011). IEEE, 2011. http://dx.doi.org/10.1109/isbi.2011.5872573.

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

Kuanar, Sanjay K., and Ananda S. Chowdhury. "Improved delaunay graph based video summarization with semantic features and canonical correlation." In 2015 Eighth International Conference on Advances in Pattern Recognition (ICAPR). IEEE, 2015. http://dx.doi.org/10.1109/icapr.2015.7050687.

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

Min Wan, Calvin Lim, Junmei Zhang, et al. "Reconstructing patient-specific cardiac models from contours via Delaunay triangulation and graph-cuts." In 2013 35th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC). IEEE, 2013. http://dx.doi.org/10.1109/embc.2013.6610165.

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

Guofeng, Zhang, and Zhang Weiqin. "Delaunay and Graph Modal-Based Bagua Layout Text Line Extraction for Shui Script." In 2015 IEEE International Conference on Computer and Information Technology; Ubiquitous Computing and Communications; Dependable, Autonomic and Secure Computing; Pervasive Intelligence and Computing (CIT/IUCC/DASC/PICOM). IEEE, 2015. http://dx.doi.org/10.1109/cit/iucc/dasc/picom.2015.104.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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