Sciweavers

727 search results - page 41 / 146
» One line and n points
Sort
View
CORR
2008
Springer
141views Education» more  CORR 2008»
15 years 6 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...
COMPGEOM
2009
ACM
16 years 15 days ago
Shooting permanent rays among disjoint polygons in the plane
We present a data structure for ray shooting-and-insertion in the free space among disjoint polygonal obstacles with a total of n vertices in the plane, where each ray starts at t...
Mashhood Ishaque, Bettina Speckmann, Csaba D. T&oa...
ITC
2003
IEEE
177views Hardware» more  ITC 2003»
15 years 11 months ago
Analyzing the Effectiveness of Multiple-Detect Test Sets
Multiple-detect test sets have been shown to be effective in lowering defect level. Other researchers have noted that observing the effects of a defect can be controlled by sensit...
R. D. (Shawn) Blanton, Kumar N. Dwarakanath, Aniru...
FAW
2007
Springer
110views Algorithms» more  FAW 2007»
16 years 4 days ago
Maximizing the Number of Independent Labels in the Plane
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
Kuen-Lin Yu, Chung-Shou Liao, Der-Tsai Lee
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 3 months ago
Balanced Interval Coloring
We consider the discrepancy problem of coloring n intervals with k colors such that at each point on the line, the maximal difference between the number of intervals of any two co...
Antonios Antoniadis, Falk Hüffner, Pascal Len...