5,905 research outputs found
Computational Geometry Column 41
The recent result that n congruent balls in R^d have at most 4 distinct
geometric permutations is described.Comment: To appear in SIGACT News and in Internat. J. Comput. Geom. App
Generating derivative structures: Algorithm and applications
We present an algorithm for generating all derivative superstructures--for
arbitrary parent structures and for any number of atom types. This algorithm
enumerates superlattices and atomic configurations in a geometry-independent
way. The key concept is to use the quotient group associated with each
superlattice to determine all unique atomic configurations. The run time of the
algorithm scales linearly with the number of unique structures found. We show
several applications demonstrating how the algorithm can be used in materials
design problems. We predict an altogether new crystal structure in Cd-Pt and
Pd-Pt, and several new ground states in Pd-rich and Pt-rich binary systems
Lecture notes: Semidefinite programs and harmonic analysis
Lecture notes for the tutorial at the workshop HPOPT 2008 - 10th
International Workshop on High Performance Optimization Techniques (Algebraic
Structure in Semidefinite Programming), June 11th to 13th, 2008, Tilburg
University, The Netherlands.Comment: 31 page
2D multi-objective placement algorithm for free-form components
This article presents a generic method to solve 2D multi-objective placement
problem for free-form components. The proposed method is a relaxed placement
technique combined with an hybrid algorithm based on a genetic algorithm and a
separation algorithm. The genetic algorithm is used as a global optimizer and
is in charge of efficiently exploring the search space. The separation
algorithm is used to legalize solutions proposed by the global optimizer, so
that placement constraints are satisfied. A test case illustrates the
application of the proposed method. Extensions for solving the 3D problem are
given at the end of the article.Comment: ASME 2009 International Design Engineering Technical Conferences &
Computers and Information in Engineering Conference, San Diego : United
States (2009
Algorithmic aspects of branched coverings
This is the announcement, and the long summary, of a series of articles on
the algorithmic study of Thurston maps. We describe branched coverings of the
sphere in terms of group-theoretical objects called bisets, and develop a
theory of decompositions of bisets.
We introduce a canonical "Levy" decomposition of an arbitrary Thurston map
into homeomorphisms, metrically-expanding maps and maps doubly covered by torus
endomorphisms. The homeomorphisms decompose themselves into finite-order and
pseudo-Anosov maps, and the expanding maps decompose themselves into rational
maps.
As an outcome, we prove that it is decidable when two Thurston maps are
equivalent. We also show that the decompositions above are computable, both in
theory and in practice.Comment: 60-page announcement of 5-part text, to apper in Ann. Fac. Sci.
Toulouse. Minor typos corrected, and major rewrite of section 7.8, which was
studying a different map than claime
Chromatic Numbers of Simplicial Manifolds
Higher chromatic numbers of simplicial complexes naturally
generalize the chromatic number of a graph. In any fixed dimension
, the -chromatic number of -complexes can become arbitrarily
large for [6,18]. In contrast, , and only
little is known on for .
A particular class of -complexes are triangulations of -manifolds. As a
consequence of the Map Color Theorem for surfaces [29], the 2-chromatic number
of any fixed surface is finite. However, by combining results from the
literature, we will see that for surfaces becomes arbitrarily large
with growing genus. The proof for this is via Steiner triple systems and is
non-constructive. In particular, up to now, no explicit triangulations of
surfaces with high were known.
We show that orientable surfaces of genus at least 20 and non-orientable
surfaces of genus at least 26 have a 2-chromatic number of at least 4. Via a
projective Steiner triple systems, we construct an explicit triangulation of a
non-orientable surface of genus 2542 and with face vector
that has 2-chromatic number 5 or 6. We also give orientable examples with
2-chromatic numbers 5 and 6.
For 3-dimensional manifolds, an iterated moment curve construction [18] along
with embedding results [6] can be used to produce triangulations with
arbitrarily large 2-chromatic number, but of tremendous size. Via a topological
version of the geometric construction of [18], we obtain a rather small
triangulation of the 3-dimensional sphere with face vector
and 2-chromatic number 5.Comment: 22 pages, 11 figures, revised presentatio
- …