2536 search results - page 48 / 508 » Constructing Optimal Highways |
COMPGEOM
1994
ACM
14 years 2 months ago
1994
ACM
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
CG
2005
Springer
13 years 10 months ago
2005
Springer
This paper presents an intuitive, freehand sketching application for Computer Aided Design (CAD) that can reconstruct a 3D object from a single, flat, freehand sketch. A pen is us...
NETWORKS
2002
13 years 9 months ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
TCBB
2011
13 years 5 months ago
2011
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
— Optimal partitioned cyclic difference packings (PCDPs) are shown to give rise to optimal frequency-hopping sequences and optimal comma-free codes. New constructions for PCDPs, ...