Sciweavers

1879 search results - page 70 / 376
» Computational geometry algorithms library
Sort
View
COMPGEOM
2005
ACM
15 years 6 months ago
Inclusion-exclusion formulas from independent complexes
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
Dominique Attali, Herbert Edelsbrunner
COMPGEOM
2005
ACM
15 years 6 months ago
1-link shortest paths in weighted regions
We illustrate the Link Solver software for computing 1-link shortest paths in weighted regions. The Link Solver implements a prune-and-search method that can be used to approximat...
Ovidiu Daescu, James D. Palmer
IPPS
2006
IEEE
15 years 10 months ago
A stochastic multi-objective algorithm for the design of high performance reconfigurable architectures
The increasing demand for FPGAs and reconfigurable hardware targeting high performance low power applications has lead to an increasing requirement for new high performance reconf...
Wing On Fung, Tughrul Arslan
SG
2005
Springer
15 years 9 months ago
Generation of Glyphs for Conveying Complex Information, with Application to Protein Representations
Abstract. We present a method to generate glyphs which convey complex information in graphical form. A glyph has a linear geometry which is specified using geometric operations, e...
Greg Pintilie, Brigitte Tuekam, Christopher W. V. ...
ICPR
2008
IEEE
16 years 5 months ago
Robust decomposition of a digital curve into convex and concave parts
We propose a linear in time and easy-to-implement algorithm that robustly decomposes a digital curve into convex and concave parts. This algorithm is based on classical tools in d...
Tristan Roussillon, Isabelle Sivignon, Laure Tougn...