Sciweavers

64 search results - page 8 / 13
» Irreducible triangulations are small
Sort
View
COMPGEOM
1996
ACM
13 years 11 months ago
Robust Adaptive Floating-Point Geometric Predicates
Fast C implementations of four geometric predicates, the 2D and 3D orientation and incircle tests, are publicly available. Their inputs are ordinary single or double precision flo...
Jonathan Richard Shewchuk
ICCV
2007
IEEE
14 years 9 months ago
3-D Reconstruction from Sparse Views using Monocular Vision
We consider the task of creating a 3-d model of a large novel environment, given only a small number of images of the scene. This is a difficult problem, because if the images are...
Ashutosh Saxena, Min Sun, Andrew Y. Ng
ICIP
2009
IEEE
14 years 8 months ago
Segmentation On Surfaces With The Closest Point Method
We propose a method to detect objects and patterns in textures on general surfaces. Our approach applies the Chan?Vese variational model for active contours without edges to the p...
WSCG
2003
177views more  WSCG 2003»
13 years 9 months ago
Efficient NURBS Rendering using View-Dependent LOD and Normal Maps
Rendering large trimmed NURBS models with high quality at interactive frame rates is of great interest for industry, since nearly all their models are designed on the basis of thi...
Michael Guthe, Reinhard Klein
ESA
1999
Springer
95views Algorithms» more  ESA 1999»
13 years 12 months ago
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
Xin He, Ming-Yang Kao, Hsueh-I Lu