Results 231 to 240 of about 67,823 (266)
Some of the next articles are maybe not open access.
Graham triangulations and triangulations with a center are hamiltonean
Information Processing Letters, 2005Let P be a point set with n elements in general position. A triangulation T of P is a set of triangles with disjoint interiors such that their union is the convex hull of P, no triangle contains an element of P in its interior, and the vertices of the triangles of T are points of P.
Ruy Fabila-Monroy, Jorge Urrutia
openaire +1 more source
Joint triangulations and triangulation maps
Proceedings of the third annual symposium on Computational geometry - SCG '87, 1987In rubber-sheeting applications in cartography, it is useful to seek piecewise-linear homeomorphisms (PLH maps) between rectangular regions which map an arbitrary sequence of n points {p1, p2, …,pn} from the interior of one rectangle to a corresponding sequence {q1, q2, …, qn} of n points in the interior of the second region.
openaire +1 more source
Combinatorica, 1991
A surface \(S\) is a closed 2-manifold, either orientable \((S_p\), of genus \(p\geq 0)\) or nonorientable \((N_p\), of genus \(p>0\)). A clean triangulation of \(S\) is a 2-cell imbedding of a graph \(G\) into \(S\) having every 2-cell bounded by a 3-cycle of \(G\) and having every 3-cycle of \(G\) bound a 2-cell. Then \(\tau(S)\) denotes the smallest
Nora Hartsfield, Gerhard Ringel
openaire +1 more source
A surface \(S\) is a closed 2-manifold, either orientable \((S_p\), of genus \(p\geq 0)\) or nonorientable \((N_p\), of genus \(p>0\)). A clean triangulation of \(S\) is a 2-cell imbedding of a graph \(G\) into \(S\) having every 2-cell bounded by a 3-cycle of \(G\) and having every 3-cycle of \(G\) bound a 2-cell. Then \(\tau(S)\) denotes the smallest
Nora Hartsfield, Gerhard Ringel
openaire +1 more source
Journal of Nursing Scholarship, 2001
Purpose: To explore various types of triangulation strategies and to indicate when different types of triangulation should be used in research.Methods: Reviews included literature on triangulation and multimethod strategies published since 1960 and research books specifically focusing on triangulation.Findings: Triangulation is the combination of at
exaly +3 more sources
Purpose: To explore various types of triangulation strategies and to indicate when different types of triangulation should be used in research.Methods: Reviews included literature on triangulation and multimethod strategies published since 1960 and research books specifically focusing on triangulation.Findings: Triangulation is the combination of at
exaly +3 more sources
2003
We analyze several perfect-information combinatorial games played on planar triangulations. We introduce three broad categories of such games: constructing, transforming, and marking triangulations. In various situations, we develop polynomial-time algorithms to determine who wins a given game under optimal play, and to find a winning strategy.
Oswin Aichholzer +8 more
openaire +1 more source
We analyze several perfect-information combinatorial games played on planar triangulations. We introduce three broad categories of such games: constructing, transforming, and marking triangulations. In various situations, we develop polynomial-time algorithms to determine who wins a given game under optimal play, and to find a winning strategy.
Oswin Aichholzer +8 more
openaire +1 more source
Computer Vision and Image Understanding, 2009
This article presents a computationally efficient approach to the triangulation of 3D points from their projections in two views. The homogenous coordinates of a 3D point is given as a multi-linear mapping on its homogeneous image coordinates, a computation of low computational complexity.
openaire +1 more source
This article presents a computationally efficient approach to the triangulation of 3D points from their projections in two views. The homogenous coordinates of a 3D point is given as a multi-linear mapping on its homogeneous image coordinates, a computation of low computational complexity.
openaire +1 more source
Combinatories and Triangulations
2004The problem searching for an optimal triangulation with required properties (in a plane) is solved in this paper. Existing approaches are shortly introduced here and, specially, this paper is dedicated to the brute force methods. Several new brute force methods that solve the problem from different points of view are described here.
Tomas Hlavaty, Václav Skala
openaire +1 more source
ACM Transactions on Graphics, 2019
We introduce the notion of harmonic triangulations: a harmonic triangulation simultaneously minimizes the Dirichlet energy of all piecewise linear functions. By a famous result of Rippa, Delaunay triangulations are the harmonic triangulations of planar point sets. We prove by explicit counterexample that in 3D a harmonic triangulation does not exist in
openaire +1 more source
We introduce the notion of harmonic triangulations: a harmonic triangulation simultaneously minimizes the Dirichlet energy of all piecewise linear functions. By a famous result of Rippa, Delaunay triangulations are the harmonic triangulations of planar point sets. We prove by explicit counterexample that in 3D a harmonic triangulation does not exist in
openaire +1 more source
The triangulation: An adaptive triangulation in any dimension
Computers & Graphics, 2006Antônio Castelo Filho +4 more
openaire +1 more source