Sciweavers

69 search results - page 2 / 14
» Polynomial frames on the sphere
Sort
View
ICRA
2008
IEEE
104views Robotics» more  ICRA 2008»
13 years 11 months ago
Towards locally computable polynomial navigation functions for convex obstacle workspaces
— In this paper we present a polynomial Navigation Function (NF) for a sphere world that can be constructed almost locally, with partial knowledge of the environment. The present...
Grigoris Lionis, Xanthi Papageorgiou, Kostas J. Ky...
JGTOOLS
2008
109views more  JGTOOLS 2008»
13 years 5 months ago
Fast Equal-Area Mapping of the (Hemi)Sphere using SIMD
We present a fast vectorized implementation of a transform that maps points in the unit square to the surface of the sphere, while preserving fractional area. The mapping uses the ...
Petrik Clarberg
DCC
2005
IEEE
14 years 5 months ago
Real, Tight Frames with Maximal Robustness to Erasures
Motivated by the use of frames for robust transmission over the Internet, we present a first systematic construction of real tight frames with maximum robustness to erasures. We a...
Jelena Kovacevic, Markus Püschel
CORR
2006
Springer
93views Education» more  CORR 2006»
13 years 5 months ago
Fast and Simple Methods For Computing Control Points
The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials ...
Jean H. Gallier, Weqing Gu
CGF
2008
137views more  CGF 2008»
13 years 5 months ago
Real-Time Indirect Illumination and Soft Shadows in Dynamic Scenes Using Spherical Lights
We present a method for rendering approximate soft shadows and diffuse indirect illumination in dynamic scenes. The proposed method approximates the original scene geometry with a...
P. Guerrero, Stefan Jeschke, Michael Wimmer