Sciweavers

2638 search results - page 87 / 528
» Random Geometric Complexes
Sort
View
CCCG
2010
15 years 5 months ago
On degeneracy of lower envelopes of algebraic surfaces
We analyze degeneracy of lower envelopes of algebraic surfaces. We focus on the cases omitted in the existing complexity analysis of lower envelopes [Halperin and Sharir 1993], an...
Kimikazu Kato
COMPGEOM
2009
ACM
15 years 9 months ago
Visibility maps of realistic terrains have linear smoothed complexity
We study the complexity of the visibility map of terrains whose triangles are fat, not too steep and have roughly the same size. It is known that the complexity of the visibility ...
Mark de Berg, Herman J. Haverkort, Constantinos P....
IJCGA
2007
44views more  IJCGA 2007»
15 years 4 months ago
On the Expected Size of the 2D Visibility Complex
We study the expected size of the 2D visibility complex of randomly distributed objects in the plane. We prove that the asymptotic expected number of free bitangents (which corres...
Hazel Everett, Sylvain Lazard, Sylvain Petitjean, ...
CVPR
2001
IEEE
16 years 6 months ago
Automatic Description of Buildings with Complex Rooftops from Multiple Images
We present a model-based approach to detecting and describing compositions of buildings with complex rooftops. Previous approaches have dealt with either simpler models or models ...
Zu Whan Kim, Andres Huertas, Ramakant Nevatia
GLVLSI
2009
IEEE
159views VLSI» more  GLVLSI 2009»
15 years 11 months ago
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...
Renshen Wang, Chung-Kuan Cheng