Results 21 to 30 of about 655,112 (194)
Scalable Surface Reconstruction with Delaunay‐Graph Neural Networks [PDF]
Computer Graphics Forum, 2021 AbstractWe introduce a novel learning‐based, visibility‐aware, surface reconstruction method for large‐scale, defect‐laden point clouds. Our approach can cope with the scale and variety of point cloud defects encountered in real‐life Multi‐View Stereo (MVS) acquisitions.
Sulzer, Raphael +3 more
openaire +5 more sources
Outerplanar Graphs and Delaunay Triangulations [PDF]
, 2012 Dillencourt [1] showed that all maximal outerplanar graphs can be realized as Delaunay triangulations of points in convex position. In this note, we give two new, alternate proofs.
Alam, Ashraful +2 more
openaire +4 more sources
Delaunay-supported edges for image graphs [PDF]
2015 IEEE International Conference on Image Processing (ICIP), 2015 Graphs are a powerful and versatile data structure for pattern recognition. However, their flexibility brings inherent complexities for algorithms which seek to create or utilise graphs. In the context of computer vision, many feature detection algorithms can extract a suitable vertex set from an image.
Nicholas Dahm +3 more
openaire +1 more source
Hamiltonicity for convex shape Delaunay and Gabriel graphs [PDF]
Computational Geometry, 2019 We study Hamiltonicity for some of the most general variants of Delaunay and Gabriel graphs. Instead of defining these proximity graphs using circles, we use an arbitrary convex shape \(\mathcal {C}\) . Let S be a point set in the plane. The k-order Delaunay graph of S, denoted k- \({DG}_{\mathcal {C}}(S)\) , has vertex set S and edge pq provided that ...
Prosenjit Bose +3 more
openaire +7 more sources
ISPRS International Journal of Geo-Information, 2020 Building pattern recognition is fundamental to a wide range of downstream applications, such as urban landscape evaluation, social analyses, and map generalization. Although many studies have been conducted, there is still a lack of satisfactory results,
Xianjin He, Min Deng, Guowei Luo
doaj +1 more source
Discrete & Computational Geometry, 2015 This is a revision of the paper arXiv:1104.0622 presented in SoCG 2010.
Pankaj K. Agarwal +5 more
openaire +3 more sources
Matching Delaunay graphs [PDF]
, 1995 This paper describes a Bayesian framework for matching Delaunay graphs. Our matching process is realised in terms of probabilistic relaxation. The novelty of our method stems from its use of a support function specified in terms of triangular face-units of the graphs under match.
Andrew M. Finch, Edwin R. Hancock
openaire +2 more sources
Graph Theory and Mean Shift Segmentation Based Classification of Building Facades [PDF]
, 2011 Automatic classification of building facades has become a field of interest for researchers, since it can provide important solutions to many remote sensing research field.
Sirmacek, Beril, Beril Sirmacek
core +1 more source
Essential Constraints of Edge-Constrained Proximity Graphs
Journal of Graph Algorithms and Applications, 2017 Given a plane forest $F = (V, E)$ of $|V| = n$ points, we find the minimum set $S \subseteq E$ of edges such that the edge-constrained minimum spanning tree over the set $V$ of vertices and the set $S$ of constraints contains $F$. We present an $O(n \log
Prosenjit Bose +3 more
doaj +1 more source