Sciweavers

188 search results - page 36 / 38
» Pointed Drawings of Planar Graphs
Sort
View
WADS
1993
Springer
110views Algorithms» more  WADS 1993»
15 years 1 months ago
A Dynamic Separator Algorithm
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere ...
Deganit Armon, John H. Reif
COCOA
2009
Springer
15 years 1 months ago
An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
Jingfa Liu, Yonglei Yao, Yu Zheng, Huantong Geng, ...
COMBINATORICS
1998
89views more  COMBINATORICS 1998»
14 years 9 months ago
Venn Diagrams with Few Vertices
An n-Venn diagram is a collection of n finitely-intersecting simple closed curves in the plane, such that each of the 2n sets X1 ∩X2 ∩· · ·∩Xn, where each Xi is the open...
Bette Bultena, Frank Ruskey
RT
2004
Springer
15 years 3 months ago
Bixels: Picture Samples with Sharp Embedded Boundaries
Pixels store a digital image as a grid of point samples that can reconstruct a limited-bandwidth continuous 2-D source image. Although convenient for anti-aliased display, these b...
Jack Tumblin, Prasun Choudhury
ENTCS
2008
95views more  ENTCS 2008»
14 years 9 months ago
Coverage-biased Random Exploration of Models
This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk ...
Marie-Claude Gaudel, Alain Denise, Sandrine-Domini...