Sciweavers

4850 search results - page 252 / 970
» Proof and Computation in Geometry
Sort
View
LFCS
2007
Springer
16 years 23 days ago
The Intensional Lambda Calculus
We introduce a natural deduction formulation for the Logic of Proofs, a refinement of modal logic S4 in which the assertion PA is replaced by [[s]]A whose intended reading is “s...
Sergei N. Artëmov, Eduardo Bonelli
FOCS
2006
IEEE
16 years 21 days ago
Dispersion of Mass and the Complexity of Randomized Geometric Algorithms
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
Luis Rademacher, Santosh Vempala
RT
1998
Springer
15 years 10 months ago
Interactively Modeling with Photogrammetry
We describe an interactive system to reconstruct 3D geometry and extract textures from a set of photographs taken with arbitrary camera parameters. The basic idea is to let the use...
Pierre Poulin, Mathieu Ouimet, Marie-Claude Frasso...
CAGD
2010
215views more  CAGD 2010»
15 years 6 months ago
Surface fitting and registration of point clouds using approximations of the unsigned distance function
Many problems in computer aided geometric design and geometry processing are stated as least
Simon Flöry, Michael Hofer
MFCS
1993
Springer
15 years 10 months ago
Real Number Computability and Domain Theory
We present the different constructive definitions of real number that can be found in the literature. Using domain theory we analyse the notion of computability that is substant...
Pietro Di Gianantonio