Sciweavers

4761 search results - page 81 / 953
» Generalizing Boundary Points
Sort
View
117
Voted
CCCG
2001
15 years 4 months ago
Tight degree bounds for pseudo-triangulations of points
We show that every set of n points in general position has a minimum pseudo-triangulation whose maximum vertex degree is five. In addition, we demonstrate that every point set in ...
Lutz Kettner, David G. Kirkpatrick, Bettina Speckm...
133
Voted
ICALP
2003
Springer
15 years 8 months ago
A Competitive Algorithm for the General 2-Server Problem
We consider the general on-line two server problem in which at each step both servers receive a request, which is a point in a metric space. One of the servers has to be moved to i...
René Sitters, Leen Stougie, Willem de Paepe
155
Voted
BILDMED
2003
176views Algorithms» more  BILDMED 2003»
15 years 4 months ago
Volumetric Meshes for Real-Time Medical Simulations
We present an approach to generating volumetric meshes from closed triangulated surface meshes. The approach initially generates a structured hexahedral mesh based on the bounding ...
Matthias Müller, Matthias Teschner
107
Voted
PR
1998
90views more  PR 1998»
15 years 3 months ago
Supportedness and tameness differentialless geometry of plane curves
—We introduce a class of planar arcs and curves, called tame arcs, which is general enough to describe (parts of) the boundaries of planar real objects. A tame arc can have smoot...
Longin Jan Latecki, Azriel Rosenfeld
124
Voted
SSDBM
2008
IEEE
114views Database» more  SSDBM 2008»
15 years 9 months ago
A General Framework for Increasing the Robustness of PCA-Based Correlation Clustering Algorithms
Abstract. Most correlation clustering algorithms rely on principal component analysis (PCA) as a correlation analysis tool. The correlation of each cluster is learned by applying P...
Hans-Peter Kriegel, Peer Kröger, Erich Schube...