Sciweavers

349 search results - page 45 / 70
» Covering a Set of Points with a Minimum Number of Lines
Sort
View
ICAD
2004
13 years 9 months ago
The Audio Abacus: Representing a Wide Range of Values with Accuracy and Precision
Point estimation is a relatively unexplored facet of sonfication. We present a new computer application, the Audio Abacus, designed to transform numbers into tones following the a...
Bruce N. Walker, Lisa M. Mauney, Justin Godfrey
DAC
1989
ACM
13 years 12 months ago
A New Approach to the Rectilinear Steiner Tree Problem
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
Jan-Ming Ho, Gopalakrishnan Vijayan, C. K. Wong
ALENEX
2003
139views Algorithms» more  ALENEX 2003»
13 years 9 months ago
Interpolation over Light Fields with Applications in Computer Graphics
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...
F. Betul Atalay, David M. Mount
ISAAC
2000
Springer
178views Algorithms» more  ISAAC 2000»
13 years 11 months ago
Simple Algorithms for a Weighted Interval Selection Problem
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
Thomas Erlebach, Frits C. R. Spieksma
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 8 months ago
Obfuscated Drawings of Planar Graphs
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an i...
Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Math...