Sciweavers

876 search results - page 12 / 176
» Complexity in geometric SINR
Sort
View
PR
2008
90views more  PR 2008»
13 years 7 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
13 years 8 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...
CORR
2011
Springer
195views Education» more  CORR 2011»
13 years 2 months ago
Simplicial Homology of Random Configurations
Given a Poisson process on a d-dimensional torus, its random geometric simplicial complex is the complex whose vertices are the points of the Poisson process and simplices are give...
Laurent Decreusefond, Eduardo Ferraz, Hugues Randr...
FAW
2008
Springer
104views Algorithms» more  FAW 2008»
13 years 9 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
3DPVT
2006
IEEE
216views Visualization» more  3DPVT 2006»
13 years 11 months ago
Object Modeling with Guaranteed Fulfillment of Geometric Constraints
Object modeling under consideration of geometric constraints is an important task. In this paper we describe a novel approach to achieving this goal. It has the nice property that...
Da-Chuan Cheng, Xiaoyi Jiang