Sciweavers

339 search results - page 36 / 68
» Geometry of Graphs
Sort
View
ISVC
2010
Springer
13 years 8 months ago
Computer-Generated Tie-Dyeing Using a 3D Diffusion Graph
Abstract. Hand dyeing generates artistic representations with unique and complex patterns. The aesthetics of dyed patterns on a cloth originate from the physical properties of dyei...
Yuki Morimoto, Kenji Ono
IMR
2003
Springer
14 years 3 months ago
When and Why Ruppert's Algorithm Works
An “adaptive” variant of Ruppert’s Algorithm for producing quality triangular planar meshes is introduced. The algorithm terminates for arbitrary Planar Straight Line Graph ...
Gary L. Miller, Steven E. Pav, Noel Walkington
COMPGEOM
1990
ACM
14 years 2 months ago
Minimum-Link Paths Among Obstacles in the Plane
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
Joseph S. B. Mitchell, Günter Rote, Gerhard J...
DGCI
2006
Springer
14 years 1 months ago
Topological and Geometrical Reconstruction of Complex Objects on Irregular Isothetic Grids
In this paper, we address the problem of vectorization of binary images on irregular isothetic grids. The representation of graphical elements by lines is common in document analys...
Antoine Vacavant, David Coeurjolly, Laure Tougne
COCOA
2008
Springer
13 years 12 months ago
Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...
Peter Damaschke