Sciweavers

102291 search results - page 58 / 20459
» Computability in Computational Geometry
Sort
View
87
Voted
CVPR
2008
IEEE
16 years 6 months ago
Flat refractive geometry
Tali Treibitz, Yoav Y. Schechner, Hanumant Singh
DGCI
2008
Springer
15 years 5 months ago
Gift-Wrapping Based Preimage Computation Algorithm
Based on a classical convex hull algorithm called Gift-Wrapping, the purpose of the paper is to provide a new algorithm for computing the vertices of a polytope called preimage - ...
Yan Gérard, Fabien Feschet, David Coeurjoll...
CG
2004
Springer
15 years 3 months ago
A survey of point-based techniques in computer graphics
In recent years point-based geometry has gained increasing attention as an alternative surface representation, both for efficient rendering and for flexible geometry processing of...
Leif Kobbelt, Mario Botsch
116
Voted
ECAL
2001
Springer
15 years 8 months ago
Amorphous Geometry
Amorphous computing is a recently introduced paradigm that favours geometrical configurations. The physical layout of an amorphous computer is based on a possibly irregular and er...
Ellie D'Hondt, Theo D'Hondt
CIE
2005
Springer
15 years 9 months ago
Abstract Geometrical Computation: Turing-Computing Ability and Undecidability
geometrical computation: Turing-computing ability and undecidability J´erˆome Durand-Lose Laboratoire d’Informatique Fondamentale d’Orl´eans, Universit´e d’Orl´eans, B.P...
Jérôme Durand-Lose