Sciweavers

2638 search results - page 190 / 528
» Random Geometric Complexes
Sort
View
CCCG
2006
15 years 8 months ago
Polygon Reconstruction from Line Cross-Sections
We study the following geometric probing problem: Reconstruct a planar polygon from its intersections with a collection of arbitrarily-oriented "cutting" lines. We propo...
Gill Barequet, Craig Gotsman, Avishay Sidlesky
CAD
1999
Springer
15 years 6 months ago
Multiple sweeping using the Denavit-Hartenberg representation method
The method of consecutive revolving or extrusion of a geometric entity in a CAD system is typically used by a designer to represent complex solids. While it is evident that consec...
Karim Abdel-Malek, Saeb Othman
VDB
1998
117views Database» more  VDB 1998»
15 years 7 months ago
Textural Features and Relevance Feedback for Image Retrieval
This paper focuses on the retrieval of complex images based on their textural content. We use GMRF for texture discrimination and a region-growing algorithm for texture segmentati...
Eugenio Di Sciascio, Giacomo Piscitelli, Augusto C...
FOCM
2010
111views more  FOCM 2010»
15 years 3 months ago
A Note on the Finite Variance of the Averaging Function for Polynomial System Solving
In [BP08], the average complexity of linear homotopy methods to solve polynomial equations with random initial input (in a sense to be described below) was proven to be finite, an...
Carlos Beltrán, Michael Shub
CVPR
2003
IEEE
16 years 8 months ago
Automated Feature-Based Range Registration of Urban Scenes of Large Scale
We are building a system that can automatically acquire 3D range scans and 2D images to build geometrically and photometrically correct 3D models of urban environments. A major bo...
Ioannis Stamos, Marius Leordeanu