Sciweavers

2638 search results - page 44 / 528
» Random Geometric Complexes
Sort
View
COMPGEOM
2005
ACM
15 years 3 months ago
Inclusion-exclusion formulas from independent complexes
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
Dominique Attali, Herbert Edelsbrunner
PR
2008
90views more  PR 2008»
15 years 1 months ago
Fast computation of geometric moments using a symmetric kernel
This paper presents a novel set of geometric moments with symmetric kernel (SGM) obtained using an appropriate transformation of image coordinates. By using this image transformat...
Chong-Yaw Wee, Paramesran Raveendran, R. Mukundan
GRAPHICSINTERFACE
1996
15 years 3 months ago
Fast Rendering of Complex Environments Using a Spatial Hierarchy
We present a new method for accelerating the rendering of complex static scenes. The technique is applicable to unstructured scenes containing arbitrary geometric primitives and h...
Bradford L. Chamberlain, Tony DeRose, Dani Lischin...
CISSE
2008
Springer
15 years 3 months ago
Game Theoretic Approach for Discovering Vulnerable Links in Complex Networks
Mishkovski Igor, Sonja Filiposka, Sasho Gramatikov...
FAW
2008
Springer
104views Algorithms» more  FAW 2008»
15 years 3 months ago
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
Michael Dom, Somnath Sikdar