Sciweavers

102291 search results - page 374 / 20459
» Computability in Computational Geometry
Sort
View
COMPGEOM
2006
ACM
16 years 23 days ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote
DAC
2006
ACM
16 years 23 days ago
How will the fabless model survive?
The fabless model was traditionally enabled through clean interfaces – both in technical and business terms – between foundries and fabless semiconductor companies. However, w...
Thomas Hartung, Jim Kupec, Ana Hunter, Brad Paulse...
CW
2005
IEEE
16 years 13 days ago
Function-based Time-dependent Shape Modeling on the Web
In this paper we propose FVRML—a function-based extension of Virtual Reality Modeling Language which allows for time-dependent shape modeling on the web. Shape’s geometry, 3D ...
Qi Liu, Alexei Sourin
DSSCV
2005
Springer
16 years 10 days ago
Exploiting Deep Structure
Abstract. Blurring an image with a Gaussian of width σ and considering σ as an extra dimension, extends the image to an Gaussian scale space (GSS) image. In this GSS-image the is...
Arjan Kuijper
COMPGEOM
2004
ACM
16 years 7 days ago
Quality meshing for polyhedra with small angles
We present an algorithm to compute a Delaunay mesh conforming to a polyhedron possibly with small input angles. The radius-edge ratio of most output tetrahedra are bounded by a co...
Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, Tath...
« Prev « First page 374 / 20459 Last » Next »