Sciweavers

69 search results - page 9 / 14
» Polynomial frames on the sphere
Sort
View
PG
2007
IEEE
14 years 1 months ago
Fast and Faithful Geometric Algorithm for Detecting Crest Lines on Meshes
A new geometry-based finite difference method for a fast and reliable detection of perceptually salient curvature extrema on surfaces approximated by dense triangle meshes is pro...
Shin Yoshizawa, Alexander G. Belyaev, Hideo Yokota...
SIGGRAPH
1995
ACM
13 years 11 months ago
Applications of irradiance tensors to the simulation of non-Lambertian phenomena
We present new techniques for computing illumination from non-diffuse luminaires and scattering from non-diffuse surfaces. The methods are based on new closed-form expressions d...
James Arvo
ECCC
2010
89views more  ECCC 2010»
13 years 7 months ago
Lower bounds for designs in symmetric spaces
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree pol...
Noa Eidelstein, Alex Samorodnitsky
JACM
2007
115views more  JACM 2007»
13 years 7 months ago
Optimal pants decompositions and shortest homotopic cycles on an orientable surface
We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...
Éric Colin de Verdière, Francis Laza...
JGT
2007
73views more  JGT 2007»
13 years 7 months ago
New bounds on the edge number of a k-map graph
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...
Zhi-Zhong Chen