Sciweavers

8 search results - page 2 / 2
» The maximum number of halving lines and the rectilinear cros...
Sort
View
FAW
2007
Springer
110views Algorithms» more  FAW 2007»
13 years 11 months 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
COMBINATORICA
2004
69views more  COMBINATORICA 2004»
13 years 5 months ago
Structural Results For Planar Sets With Many Similar Subsets
Consider a k-element subset P of the plane. It is known that the maximum number of sets similar to P that can be found among n points in the plane is (n2 ) if and only if the cros...
Bernardo M. Ábrego, György Elekes, Sil...
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 5 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...