Sciweavers

1604 search results - page 95 / 321
» Approximation algorithms for developable surfaces
Sort
View
INFOCOM
2010
IEEE
14 years 11 months ago
Maintaining Approximate Minimum Steiner Tree and k-center for Mobile Agents in a Sensor Network
Abstract--We study the problem of maintaining group communication between m mobile agents, tracked and helped by n static networked sensors. We develop algorithms to maintain a O(l...
Dengpan Zhou, Jie Gao
121
Voted
CAD
2005
Springer
15 years 1 months ago
Drawing curves onto a cloud of points for point-based modelling
Point-based geometric models are gaining popularity in both the computer graphics and CAD fields. A related design/modelling problem is the focus of the reported research: drawing...
Phillip N. Azariadis, Nickolas S. Sapidis
ICPR
2006
IEEE
16 years 2 months ago
Fingerprint Matching Method Using Minutiae Clustering and Warping
Solving non-linear distortion problems in fingerprint matching is important and still remains as a challenging topic. We have developed a new fingerprint matching method to deal w...
Dongjin Kwon, Duck Hoon Kim, Il Dong Yun, Sang Uk ...
IV
2007
IEEE
133views Visualization» more  IV 2007»
15 years 7 months ago
CrystalDome: A Projected Hemispherical Display with a Gestural Interface
CrystalDome is an inexpensive alternative to a volumetric display based on video projector technology that supports omni-directional viewing (Figure 1). It can show mapped spheric...
Francis T. Marchese, Jonas Borjesson, Josh Rose
ICIP
2003
IEEE
16 years 3 months ago
Approximation and compression of piecewise smooth images using a wavelet/wedgelet geometric model
Inherent to photograph-like images are two types of structures: large smooth regions and geometrically smooth edge contours separating those regions. Over the past years, efficien...
Justin K. Romberg, Michael B. Wakin, Richard G. Ba...