Sciweavers

727 search results - page 62 / 146
» One line and n points
Sort
View
CLASSIFICATION
2006
103views more  CLASSIFICATION 2006»
14 years 10 months ago
On the Complexity of Ordinal Clustering
Abstract. Given a set of pairwise distances on a set of n points, constructing an edge-weighted tree whose leaves are these n points such that the tree distances would mimic the or...
Rahul Shah, Martin Farach-Colton
ICALP
2007
Springer
15 years 4 months ago
Size Competitive Meshing Without Large Angles
We present a new meshing algorithm for the plane, Overlay Stitch Meshing (OSM), accepting as input an arbitrary Planar Straight Line Graph and producing a triangulation with all an...
Gary L. Miller, Todd Phillips, Donald Sheehy
PCI
2005
Springer
15 years 3 months ago
Boundary Labelling of Optimal Total Leader Length
In this paper, we consider the leader length minimization problem for boundary labelling, i.e. the problem of finding a legal leaderlabel placement, such that the total leader len...
Michael A. Bekos, Michael Kaufmann, Katerina Potik...
ICIP
2007
IEEE
15 years 11 months ago
Epipolar Spaces and Optimal Sampling Strategies
If precise calibration information is unavailable, as is often the case for active binocular vision systems, the determination of epipolar lines becomes untenable. Yet, even witho...
James Monaco, Alan C. Bovik, Lawrence K. Cormack
DCC
2003
IEEE
15 years 9 months ago
Some New Maximal Sets of Mutually Orthogonal Latin Squares
Two ways of constructing maximal sets of mutually orthogonal Latin squares are presented. The first construction uses maximal partial spreads in PG(3, 4)\ PG(3, 2) with r lines, wh...
Patrick Govaerts, Dieter Jungnickel, Leo Storme, J...