Sciweavers

133 search results - page 6 / 27
» On the distinct distances determined by a planar point set
Sort
View
COMPGEOM
2006
ACM
14 years 1 months ago
Refolding planar polygons
Abstract This paper describes an algorithm for generating a guaranteed intersectionfree interpolation sequence between any pair of compatible polygons. Our algorithm builds on prio...
Hayley N. Iben, James F. O'Brien, Erik D. Demaine
CSC
2006
13 years 9 months ago
Minimal Enclosing Circle and Two and Three Point Partition of a Plane
Partitions of a plane, based on two or three of its points, are introduced. The study of these partitions is applied to finding the minimal enclosing circle (MEC) for a set S of n...
Felix Friedman
BMCBI
2010
121views more  BMCBI 2010»
13 years 5 months ago
A grammar-based distance metric enables fast and accurate clustering of large sets of 16S sequences
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...
David J. Russell, Samuel F. Way, Andrew K. Benson,...
PAMI
2006
107views more  PAMI 2006»
13 years 7 months ago
Robust Pose Estimation from a Planar Target
In theory, the pose of a calibrated camera can be uniquely determined from a minimum of four coplanar but noncollinear points. In practice, there are many applications of camera po...
Gerald Schweighofer, Axel Pinz
OTM
2007
Springer
14 years 2 months ago
Semantic Matching Based on Enterprise Ontologies
Semantic Web technologies have in recent years started to also find their way into the world of commercial enterprises. Enterprise ontologies can be used as a basis for determinin...
Andreas Billig, Eva Blomqvist, Feiyu Lin