4761 search results - page 81 / 953 » Generalizing Boundary Points |
CCCG
2001
13 years 9 months ago
2001
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 ...
ICALP
2003
Springer
14 years 1 months ago
2003
Springer
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...
BILDMED
2003
13 years 9 months ago
2003
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 ...
PR
1998
13 years 7 months ago
1998
—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...
SSDBM
2008
IEEE
14 years 2 months ago
2008
IEEE
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...