SODA
1992
ACM
13 years 6 months ago
1992
ACM
Given a set P of n points in the plane, we wish to find a set Q P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of fi...
CCCG
2007
13 years 6 months ago
2007
In a previous paper, Calamoneri and Massini studied the problem of drawing the multigrid network in “a grid of minimum area”. In this paper we show that we can draw the multig...
CCCG
2010
13 years 6 months ago
2010
Given a set S of n points in the plane and a fixed angle 0 < < , we show how to find all triangles of minimum area with angle that enclose S in O(n log n) time.
DAC
1997
ACM
13 years 9 months ago
1997
ACM
The concept of improving the timing behavior of a circuit by relocating flip-flops is called retiming and was first presented by Leiserson and Saxe. The ASTRA algorithm propose...
ICCAD
1997
IEEE
13 years 9 months ago
1997
IEEE
Traditional minimum area retiming algorithms attempt to achieve their prescribed objective with no regard to maintaining the initial state of the system. This issue is important f...
GECCO
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...