Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
631
QSplat: A Multiresolution Point Rendering System for Large Meshes
, 2000
"... Advances in 3D scanning technologies have enabled the practical creation of meshes with hundreds of millions of polygons. Traditional algorithms for display, simplification, and progressive transmission of meshes are impractical for data sets of this size. We describe a system for representing and p ..."
Abstract
-
Cited by 502 (8 self)
- Add to MetaCart
Advances in 3D scanning technologies have enabled the practical creation of meshes with hundreds of millions of polygons. Traditional algorithms for display, simplification, and progressive transmission of meshes are impractical for data sets of this size. We describe a system for representing
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 non-laboratory conditions. Our system employs laser triangulation rangefinders, laser time-of-flight rangefinders, digital still cameras, and a suite of software for acquiring, aligning, merg ..."
Abstract
-
Cited by 488 (8 self)
- Add to MetaCart
, merging, and viewing scanned data. As a demonstration of this system, we digitized 10 statues by Michelangelo, including the well-known figure of David, two building interiors, and all 1,163 extant fragments of the Forma Urbis Romae, a giant marble map of ancient Rome. Our largest single dataset
Modelling of branched structures using a single polygonal mesh
- In IASTED International Conference on Visualization, Imaging, and Image Processing
, 2001
"... This paper presents a method to obtain a single continuos polygonal mesh representing a branched structure taken from a tree and modelled by a L-systems-based method. A refinement process is made once the model of the tree is obtained. This process produces smooth transitions in the tree areas joini ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
This paper presents a method to obtain a single continuos polygonal mesh representing a branched structure taken from a tree and modelled by a L-systems-based method. A refinement process is made once the model of the tree is obtained. This process produces smooth transitions in the tree areas
An Application of Catalan Numbers on Cayley Tree of Order 2: Single Polygon Counting
"... Abstract. In this paper, we consider a problem on finding the number of different single connected component containing a fixed root for a given number of vertices on semi-infinite Cayley tree. The solution of this problem is the well known Catalan numbers. The result is then extended to the complet ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract. In this paper, we consider a problem on finding the number of different single connected component containing a fixed root for a given number of vertices on semi-infinite Cayley tree. The solution of this problem is the well known Catalan numbers. The result is then extended
Polygon Clipping and Polygon Reconstruction
"... Abstract. Polygon clipping is an important operation that computers execute all the time. An algorithm that clips a polygon is rather complex. Each edge of the polygon must be tested against each edge of the clipping window, usually a rectangle. As a result, new edges may be added, and existing edge ..."
Abstract
- Add to MetaCart
edges may be discarded, retained, or divided. Multiple polygons may result from clipping a single polygon. After clipping, we may have a set of segments, which must be handled to generate the clipped polygon. This work proposes two new algorithms: clipping polygon against a rectangle window, and polygon
Out-of-Core Simplification of Large Polygonal Models
, 2000
"... We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme of Rossignac and Borrel [13] by using error quadric information for the placement of each cluster's representative ve ..."
Abstract
-
Cited by 159 (10 self)
- Add to MetaCart
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme of Rossignac and Borrel [13] by using error quadric information for the placement of each cluster's representative
Zippered Polygon . . .
"... Range imaging offers an inexpensive and accurate means for digitizing the shape of three-dimensional objects. Because most objects self occlude, no single range image suffices to describe the entire object. We present a method for combining a collection of range images into a single polygonal mesh t ..."
Abstract
- Add to MetaCart
Range imaging offers an inexpensive and accurate means for digitizing the shape of three-dimensional objects. Because most objects self occlude, no single range image suffices to describe the entire object. We present a method for combining a collection of range images into a single polygonal mesh
Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers
- SIAM JOURNAL ON COMPUTING
"... The problem of searching for mobile intruders in a polygonal region by mobile searchers is considered. A searcher can move continuously inside a polygon holding a flashlight that emits a single ray of light whose direction can be changed continuously. The visibility of a searcher at any time instant ..."
Abstract
-
Cited by 156 (3 self)
- Add to MetaCart
The problem of searching for mobile intruders in a polygonal region by mobile searchers is considered. A searcher can move continuously inside a polygon holding a flashlight that emits a single ray of light whose direction can be changed continuously. The visibility of a searcher at any time
Results 1 - 10
of
631
