Sciweavers

131 search results - page 16 / 27
» On the Maximum Number of Translates in a Point Set
Sort
View
COMPGEOM
2005
ACM
13 years 9 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg
CCCG
2006
13 years 9 months ago
Optimal Polygon Placement
Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of...
Prosenjit Bose, Jason Morrison
BMVC
1998
13 years 8 months ago
Building Shape Models from Image Sequences using Piecewise Linear Approximation
A method of extracting, classifying and modelling non-rigid shapes from an image sequence is presented. Shapes are approximated by polygons where the number of sides is related to...
Derek R. Magee, Roger D. Boyle
ISPD
1998
ACM
101views Hardware» more  ISPD 1998»
13 years 11 months ago
Greedy wire-sizing is linear time
—The greedy wire-sizing algorithm (GWSA) has been experimentally shown to be very efficient, but no mathematical analysis on its convergence rate has ever been reported. In this...
Chris C. N. Chu, D. F. Wong
MICCAI
2008
Springer
14 years 8 months ago
A Novel Explicit 2D+t Cyclic Shape Model Applied to Echocardiography
In this paper, we propose a novel explicit 2D+t cyclic shape model that extends the Point Distribution Model (PDM) to shapes like myocardial contours with cyclic dynamics. We also ...
Ramón Casero, J. Alison Noble