83 search results - page 6 / 17 » Enumeration of Regular Triangulations |
DCG
2010
13 years 7 months ago
2010
: We investigate polyhedral 2k-manifolds as subcomplexes of the boundary complex of a regular polytope. We call such a subcomplex k-Hamiltonian if it contains the full k-skeleton o...
WDAG
2000
Springer
13 years 11 months ago
2000
Springer
A graph G with n vertices and maximum degree G cannot be given weak sense of direction using less than G colours. It is known that n colours are always sufficient, and it was conje...
ACCV
2006
Springer
14 years 1 months ago
2006
Springer
We present a method for the reconstruction of a specular surface, using a single camera viewpoint and the reflection of a planar target placed at two different positions. Contrar...
GRAPHICSINTERFACE
2009
13 years 5 months ago
2009
We present a simple and efficient method for reconstructing triangulated surfaces from massive oriented point sample datasets. The method combines streaming and parallelization, m...
SOFSEM
2000
Springer
13 years 11 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...