Results 1  10
of
148
MeshGit: Diffing and Merging Polygonal Meshes
"... original derivative derivative a merged original derivative b Figure 1: Example of diffing and merging polygonal meshes done automatically by MeshGit. We determine mesh differences by computing the minimal set of operations needed to change one mesh into another. Left: Visual difference of two versi ..."
Abstract
 Add to MetaCart
original derivative derivative a merged original derivative b Figure 1: Example of diffing and merging polygonal meshes done automatically by MeshGit. We determine mesh differences by computing the minimal set of operations needed to change one mesh into another. Left: Visual difference of two
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
, merging, and viewing scanned data. As a demonstration of this system, we digitized 10 statues by Michelangelo, including the wellknown 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
MeshGit: Diffing and Merging Meshes for Polygonal Modeling
"... original derivative derivative a merged original derivative b merged with subdivision Figure 1: Examples of diffing and merging polygonal meshes done automatically by MeshGit. Left: We visualize changes between two snapshots of the creation of a creature mesh as a twoway diff. The derivative mesh c ..."
Abstract
 Add to MetaCart
original derivative derivative a merged original derivative b merged with subdivision Figure 1: Examples of diffing and merging polygonal meshes done automatically by MeshGit. Left: We visualize changes between two snapshots of the creation of a creature mesh as a twoway diff. The derivative mesh
Planar Polygon Extraction and Merging from Depth Images
"... Abstract — There has been considerable interest recently in building 3D maps of environments using inexpensive depth cameras like the Microsoft Kinect sensor. We exploit the fact that typical indoor scenes have an abundance of planar features by modeling environments as sets of plane polygons. To th ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
individual observed depth images. We then contribute an approach of merging these detected polygons across successive frames while accounting for a complete history of observed plane filtered points without explicitly maintaining a list of all observed points. The FSPF and polygon merging algorithms run
Merging a Set of Polygons With NonStable Borders
, 2000
"... The paper introduces an algorithm dealing with polygons with nonstable borders. Such polygons may appear because of measuring errors or during scanning and vectorisation of blueprints. The aim of the algorithm is to remove these errors within prescribed tolerance. The algorithm uses a sweepline app ..."
Abstract
 Add to MetaCart
The paper introduces an algorithm dealing with polygons with nonstable borders. Such polygons may appear because of measuring errors or during scanning and vectorisation of blueprints. The aim of the algorithm is to remove these errors within prescribed tolerance. The algorithm uses a sweepline
Solving geometric problems with the rotating calipers
, 1983
"... Shamos [1] recently showed that the diameter of a convex nsided polygon could be computed in O(n) time using a very elegant and simple procedure which resembles rotating a set of calipers around the polygon once. In this paper we show that this simple idea can be generalized in two ways: several se ..."
Abstract

Cited by 147 (11 self)
 Add to MetaCart
include (1) finding the minimumarea rectangle enclosing a polygon, (2) computing the maximum distance between two polygons, (3) performing the vectorsum of two polygons, (4) merging polygons in a convex hull finding algorithms, and (5) finding the critical support lines between two polygons. Finding
Fast Sampling Plane Filtering, Polygon Construction and Merging from Depth Images
"... Abstract—Recently, the availability of low cost depth cameras has provided 3D sensing capabilities for mobile robots in the form of dense 3D point clouds, usable for applications like 3D mapping and reconstruction, shape analysis, pose tracking and object recognition. For all the aforementioned appl ..."
Abstract
 Add to MetaCart
convex polygons are then merged across successive depth images to generate a set of scene polygons. The FSPF and polygon merging algorithms run in real time at full camera frame rates with low CPU requirements: In a real world indoor environment scene, FSPF takes on average 1.39 ms to process a single
Abstract Merging a set of polygons with nonstable borders
"... The paper introduces an algorithm dealing with polygons with nonstable borders. Such polygons may appear because of measuring errors or during scanning and vectorisation of blueprints. The aim of the algorithm is to remove these errors within prescribed tolerance. The algorithm uses a sweepline app ..."
Abstract
 Add to MetaCart
The paper introduces an algorithm dealing with polygons with nonstable borders. Such polygons may appear because of measuring errors or during scanning and vectorisation of blueprints. The aim of the algorithm is to remove these errors within prescribed tolerance. The algorithm uses a sweepline
Huang: Interactive Polygons in RegionBased Deformable Contours for Medical Images,” Int
 Proceedings of the IEEE
, 1972
"... A new user interaction method called interactive polygons is presented in this paper. These interaction polygons are designed for use with the Active Volume Model segmentation method [1], which deforms with constraints from both Region Of Interest (ROI) and image gradient information. The two kinds ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
of interaction polygons we apply are “merge polygons” and “split polygons ” which identify the foreground and background, respectively. Users are allowed to draw these polygons to correct the original AVM segmentation results. These interactive polygons are used to update the region statistics in the original
Finding the Medial Axis of a Simple Polygon in Linear Time
 DISCRETE COMPUT. GEOM
, 1995
"... We give a lineartime algorithm for computing the medial axis of a simple polygon P, This answers a longstanding open question  previously, the best deterministic algorithm ran in O(n log n) time. We decompose P into pseudonormal histograms, then influence histograms and xy monotone histograms. ..."
Abstract

Cited by 80 (5 self)
 Add to MetaCart
We give a lineartime algorithm for computing the medial axis of a simple polygon P, This answers a longstanding open question  previously, the best deterministic algorithm ran in O(n log n) time. We decompose P into pseudonormal histograms, then influence histograms and xy monotone histograms
Results 1  10
of
148