Sciweavers

450 search results - page 8 / 90
» Quadrangulations of Planar Sets
Sort
View
JCT
2006
60views more  JCT 2006»
13 years 9 months ago
On the number of rectangulations of a planar point set
We investigate the number of different ways in which a rectangle containing a set of n noncorectilinear points can be partitioned into smaller rectangles by n (non-intersecting) s...
Eyal Ackerman, Gill Barequet, Ron Y. Pinter
CBMS
2003
IEEE
14 years 21 days ago
Planar Arrangement of High-Dimensional Biomedical Data Sets by Isomap Coordinates
This article addresses 2-dimensional layout of high-dimensional biomedical datasets, which is useful for browsing them efficiently. We employ the Isomap technique, which is based ...
Ik Soo Lim, Pablo de Heras Ciechomski, Sofiane Sar...
COMPGEOM
2005
ACM
13 years 11 months ago
Maximizing the overlap of two planar convex sets under rigid motions
Hee-Kap Ahn, Otfried Cheong, Chong-Dae Park, Chan-...
IPCO
2007
114views Optimization» more  IPCO 2007»
13 years 10 months ago
Distinct Triangle Areas in a Planar Point Set
Erd˝os, Purdy, and Straus conjectured that the number of distinct (nonzero) areas of the triangles determined by n noncollinear points in the plane is at least n−1 2 , which is...
Adrian Dumitrescu, Csaba D. Tóth