Triangulation (geometry)

Known as: Triangulation (advanced geometry), Triangulation (disambiguation) 
In geometry, a triangulation is a subdivision of a planar object into triangles, and by extension the subdivision of a higher-dimension geometric… (More)
Wikipedia

Related topics

Related topics

33 relations
Art gallery problemCartographyChew's second algorithmConstrained Delaunay triangulation
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Guidelines for conducting and reporting case study research in software engineering
Case study is a suitable research methodology for software engineering research since it studies contemporary phenomena in its… (More)
  • table 1
  • figure 1
  • table 2
  • table 4
  • table 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Multiple View Geometry Under the L ∞-norm
This paper presents a new framework for solving geometric structure and motion problems based on L∞-norm. Instead of using the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Efficient Triangulation-Based Pathfinding
In this paper we present a method for abstracting an environment represented using constrained Delaunay triangulatio ns in a way… (More)
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Structure-from-motion using lines: Representation, triangulation, and bundle adjustment
We address the problem of camera motion and 3D structure reco nstruction from line correspondences across multiple views, from… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Spacetime stereo: a unifying framework for depth from triangulation
Depth from triangulation has traditionally been investigated in a number of independent threads of research, with methods such as… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Walking in a triangulation
Given a triangulation in the plane or a tetrahedralization in 3-space, we investigate the efficiency of locating a point by… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Optimal triangulation and quadric-based surface simplification
Many algorithms for reducing the number of triangles in a surface model have been proposed, but to date there has been little… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1998
1998
Geometry-based triangulation of trimmed NURBS surfaces
An algorithm for obtaining a piecewise triangular approximation of a trimmed NURBS surface is presented. The algorithm is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1991
Highly Cited
1991
A Triangulation Algorithm from Arbitrary Shaped Multiple Planar Contours
Conventional triangulation algorithms from planar contours suffer from some limitations. For instance, incorrect results can be… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?