Sciweavers

1641 search results - page 190 / 329
» The 3D visibility complex
Sort
View
IPPS
1999
IEEE
15 years 2 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
CORR
2010
Springer
111views Education» more  CORR 2010»
14 years 10 months ago
Improved complexity bounds for real root isolation using Continued Fractions
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...
Elias P. Tsigaridas
COMPGEOM
2004
ACM
15 years 4 months ago
On lines avoiding unit balls in three dimensions
Let B be a set of n unit balls in R3 . We show that the combinatorial complexity of the space of lines in R3 that avoid all the balls of B is O(n3+ε ), for any ε > 0. This re...
Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, M...
BMCBI
2004
123views more  BMCBI 2004»
14 years 10 months ago
Interaction profile-based protein classification of death domain
Background: The increasing number of protein sequences and 3D structure obtained from genomic initiatives is leading many of us to focus on proteomics, and to dedicate our experim...
Drew Lett, Michael Hsing, Frederic Pio
CGF
1999
144views more  CGF 1999»
14 years 10 months ago
Occluder Shadows for Fast Walkthroughs of Urban Environments
This paper describes a new algorithm that employs image-based rendering for fast occlusion culling in complex urban environments. It exploits graphics hardware to render and autom...
Peter Wonka, Dieter Schmalstieg