Results 1  10
of
1,311
TRAJECTORY MODELING FOR SATELLITE IMAGE TRIANGULATION
"... The model components of satellite photogrammetry consist of a trajectory model, projection equations and parameter subset selection. The trajectory model is important because subsequent estimation is performed by making corrections or refinements to this initial path. However, satellite imagery prod ..."
Abstract
 Add to MetaCart
be implemented based on support data from six satellite image types: Quickbird, Hyperion, SPOT3, ASTER, PRISM, and EROSA. Triangulation for each image is implemented to investigate the feasibility and suitability of the different trajectory models. Also, to evaluate the result, we used the leaveoneout cross
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
 ACM Tmns. Graph
, 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
Abstract

Cited by 534 (11 self)
 Add to MetaCart
are given, one that constructs the Voronoi diagram in O(n log n) time, and another that inserts a new site in O(n) time. Both are based on the use of the Voronoi dual, or Delaunay triangulation, and are simple enough to be of practical value. The simplicity of both algorithms can be attributed
The Digital Michelangelo Project: 3D Scanning of Large Statues
, 2000
"... We describe a hardware and software system for digitizing the shape and color of large fragile objects under nonlaboratory conditions. Our system employs laser triangulation rangefinders, laser timeofflight rangefinders, digital still cameras, and a suite of software for acquiring, aligning, merg ..."
Abstract

Cited by 488 (8 self)
 Add to MetaCart
is of the David  2 billion polygons and 7,000 color images. In this paper, we discuss the challenges we faced in building this system, the solutions we employed, and the lessons we learned. We focus in particular on the unusual design of our laser triangulation scanner and on the algorithms and software we
ReTiling Polygonal Surfaces
 Computer Graphics
, 1992
"... This paper presents an automatic method of creating surface models at several levels of detail from an original polygonal description of a given object. Representing models at various levels of detail is important for achieving high frame rates in interactive graphics applications and also for speed ..."
Abstract

Cited by 445 (3 self)
 Add to MetaCart
model and the new points that are to become vertices in the retiled surface. The new model is then created by removing each original vertex and locally retriangulating the surface in a way that matches the local connectedness of the initial surface. This technique for surface retessellation has been
Triangulation
, 1994
"... In this paper, we consider the problem of finding the position of a point in space given its position in two images taken with cameras with known calibration and pose. This process requires the intersection of two known rays in space, and is commonly known as triangulation. In the absence of noise, ..."
Abstract

Cited by 48 (3 self)
 Add to MetaCart
In this paper, we consider the problem of finding the position of a point in space given its position in two images taken with cameras with known calibration and pose. This process requires the intersection of two known rays in space, and is commonly known as triangulation. In the absence of noise
Surface Reconstruction by Voronoi Filtering
 Discrete and Computational Geometry
, 1998
"... We give a simple combinatorial algorithm that computes a piecewiselinear approximation of a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to remove triangles from the Delaunay triangulation. We prove the algorithm correct by showing that for densely sampled ..."
Abstract

Cited by 405 (11 self)
 Add to MetaCart
We give a simple combinatorial algorithm that computes a piecewiselinear approximation of a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to remove triangles from the Delaunay triangulation. We prove the algorithm correct by showing that for densely sampled
ImageConsistent Surface Triangulation
, 2000
"... Given a set of 3D points that we know lie on the surface of an object, we can define many possible surfaces that pass through all of these points. Even when we consider only surface triangulations, there are still an exponential number of valid triangulations that all fit the data. Each triangulatio ..."
Abstract

Cited by 59 (1 self)
 Add to MetaCart
triangulation will produce a different faceted surface connecting the points. Our goal is to overcome this ambiguity and find the particular surface that is closest to the true object surface. We do not know the true surface but instead we assume that we have a set of images of the object. We propose selecting
ROAMing Terrain: Realtime Optimally Adapting Meshes
, 1997
"... Terrain visualization is a difficult problem for applications requiring accurate images of large datasets at high frame rates, such as flight simulation and groundbased aircraft testing using synthetic sensor stimulation. On current graphics hardware, the problem is to maintain dynamic, viewdepend ..."
Abstract

Cited by 287 (10 self)
 Add to MetaCart
Terrain visualization is a difficult problem for applications requiring accurate images of large datasets at high frame rates, such as flight simulation and groundbased aircraft testing using synthetic sensor stimulation. On current graphics hardware, the problem is to maintain dynamic, view
Efficient Implementation of MultiTriangulations
, 1998
"... The MultiTriangulation (MT) is a general framework for managing the LevelofDetail in large triangle meshes, which we have introduced in our previous work. In this paper, we describe an efficient implementation of an MT based on vertex decimation. We present general techniques for querying an MT, ..."
Abstract

Cited by 80 (10 self)
 Add to MetaCart
The MultiTriangulation (MT) is a general framework for managing the LevelofDetail in large triangle meshes, which we have introduced in our previous work. In this paper, we describe an efficient implementation of an MT based on vertex decimation. We present general techniques for querying an MT
Line triangulation for image registration
"... Georegistration of an image typically requires either 35 control points measured in the target image or 610 tie points to at least two georegistered reference images. Often control points are not available, and tie points are difficult to find across sensor types, particularly for automatic proces ..."
Abstract
 Add to MetaCart
processes. This work shows that registration can be achieved by measuring 35 lines in a target image and two reference images. The same ultimate registration accuracy can be achieved with tie points alone, lines alone, or a combination of both. Line triangulation enables automatic cross
Results 1  10
of
1,311