Sciweavers

8 search results - page 1 / 2
» Planar Separators and the Euclidean Norm
Sort
View
SIGAL
1990
216views Algorithms» more  SIGAL 1990»
13 years 8 months ago
Planar Separators and the Euclidean Norm
In this paper we show that every 2-connected embedded planar graph with faces of sizes
Hillel Gazit, Gary L. Miller
SODA
2010
ACM
167views Algorithms» more  SODA 2010»
14 years 2 months ago
Inapproximability for planar embedding problems
We consider the problem of computing a minimumdistortion bijection between two point-sets in R2 . We prove the first non-trivial inapproximability result for this problem, for the...
Jeff Edmonds, Anastasios Sidiropoulos, Anastasios ...
DAM
2007
88views more  DAM 2007»
13 years 4 months ago
Digital planarity - A review
Digital planarity is defined by digitizing Euclidean planes in the three-dimensional digital space of voxels; voxels are given either in the grid point or the grid cube model. Th...
Valentin E. Brimkov, David Coeurjolly, Reinhard Kl...
CAGD
2010
116views more  CAGD 2010»
13 years 4 months ago
On rational Minkowski Pythagorean hodograph curves
Minkowski Pythagorean hodograph curves are polynomial curves with polynomial speed, measured with respect to Minkowski norm. Curves of this special class are particularly well sui...
Jirí Kosinka, Miroslav Lávicka
COMPGEOM
2006
ACM
13 years 10 months ago
Plane embeddings of planar graph metrics
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
MohammadHossein Bateni, Mohammad Taghi Hajiaghayi,...