From yjc at photon.poly.edu Tue Jul 3 18:15:57 2001
From: yjc at photon.poly.edu (Yi-Jen Chiang)
Date: Mon Jan 9 13:41:02 2006
Subject: [DMANET] WADS 2001 Call for Participation
Message-ID:
Please note that the deadlines for early registration and for dorm room
reservation are both July 9.
The registration fees are as follows:
Early Late
Regular Registration $315 $350
Student Registration $195 $220
Early registration fees apply when payment is received by July 9, 2001.
The current fee structure and payment options were finalized on June
2. Differences from their preliminary version include lower student
fees, postponed early registration deadline, and an honor system for
non-US participants who are unable to pay by check in US
dollars. Credit cards are No Longer accepted to avoid processing fees.
-----------------------------------------------------------------------------
Call for Participation
WADS 2001
7th Workshop on Algorithms and Data Structures
August 8-10, 2001
Brown University
Providence, Rhode Island, USA
http://www.wads.org/
Sponsored by the Center for Geometric Computing and by
the Department of Computer Science at Brown University
For details on the conference program, registration and accommodation
information, see the WADS Web site http://www.wads.org/.
Deadlines:
July 9: Early Registration
July 9: Dorm Room Reservation
Invited Lectures:
M. J. Atallah (Purdue):
Secure Multi-Party Computational Geometry
F. T. Leighton (Akamai and MIT):
The Challenges of Delivering Content on the Internet
M. Yannakakis (Bell Laboratories):
Approximation of Multiobjective Optimization Problems
Conference Organization:
R. Tamassia (Brown, conference chair), Y.-J. Chiang (Polytechnic,
publicity chair), G. Shubina (Brown, local arrangements chair)
Program Committee:
F. Dehne (Carleton, co-chair), J.-R. Sack (Carleton, co-chair),
R. Tamassia (Brown, co-chair), A. Apostolico, T. Chan,
B. Codenotti, G. Di Battista, S. Dolev, M. Farach-Colton,
P. Fraigniaud, H. Gabow, S. Goldman, M. Goodrich,
R. Grossi, M. Halldorsson, S. Khuller, R. Klein, J. Kleinberg,
G. Liotta, E. Mayr, J. Mitchell, S. Naeher, T. Nishizeki,
V. Prasanna, E. Puppo, J. Rolim, J. Snoeyink, I. Tollis, I. Vrt'o,
D. Wagner, T. Warnow, S. Whitesides, P. Widmayer
--------------------------------------------------------------------------
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zpr.uni-koeln.de/dmanet
*
**********************************************************
From biedl at math.uwaterloo.ca Mon Jul 9 11:01:45 2001
From: biedl at math.uwaterloo.ca (Therese Biedl)
Date: Mon Jan 9 13:41:02 2006
Subject: [DMANET] CCCG'01: Call for participation
In-Reply-To:
Message-ID:
Early registration deadline is July 16th!
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
Call for Participation
13th Canadian Conference
on Computational Geometry
August 13-15, 2001
University of Waterloo
http://compgeo.math.uwaterloo.ca/~cccg01
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
Scope
CCCG'01 will take place in Waterloo on August 13-15 (with a welcome
reception on August 12). 44 papers will be presented at CCCG'01; a complete
list and the preliminary program is available from the conference web page.
Invited presentations will be given by Neil Sloane, George Hart and Mike
Lazaridis.
Registration
The early registration fee is CAD120 (CAD60 for students). Early
registration deadline is July 16, 2001. To register, please visit the
conference web page.
Accommodation
A block of rooms has been reserved in Hotel Laurier (the student residences
of nearby Wilfrid Laurier University). Please reserve before July 16, 2001.
Various other hotels are available nearby, see the conference web page for
details.
Further Information
Travel directions, local information, and an outline of the program are also
available from the conference web page.
Important dates
Submission of final paper: June 29, 2001
Early registration: July 16, 2001
Accommodation: July 16, 2001
Conference: August 13-15, 2001
Contact Information
Therese Biedl
Dept. of Computer Science
University of Waterloo
Waterloo, ON N2L 3G1
Phone: (519) 888-4567x4721
Fax: (519) 885-1208
Email: biedl@uwaterloo.ca
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zpr.uni-koeln.de/dmanet
*
**********************************************************
From rohitsi at CS.Stanford.EDU Mon Jul 9 01:18:06 2001
From: rohitsi at CS.Stanford.EDU (Rohit Singh)
Date: Mon Jan 9 13:41:02 2006
Subject: dist btwn points sbjct to threshold
Message-ID:
Hi,
This is a newbie question, so I don't know if this is a standard problem:
I am doing some protein-modeling work. Given a set of points with 3-D
coordinates, I am interested in finding all pairs of points such that the
distance between the points is less than some threshold distance. This
threshold distance is chosen, independently, on the basis of energy
considerations. For each such pair, I also need the point-point distance.
The brute force way I am using right now is to go through all pairs of
points and calculate their distance and see if it is less than threshold.
Of course, one obvious improvement is to keep track, while calculating the
inter-point distance along each dimension, of the cumulative
square-of-distance (across all the dimensions considered so far) and stop
as soon as you exceed the square of the threshold. But since I only have 3
dimensions, it doesn't buy me much.
Are there more efficient ways of doing this?
Thanks in advance,
Rohit
-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request@research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.
From barequet at cs.Technion.AC.IL Wed Jul 11 08:51:18 2001
From: barequet at cs.Technion.AC.IL (Gill Barequet)
Date: Mon Jan 9 13:41:02 2006
Subject: Rectangular packing
Message-ID: <200107110451.HAA00037@cs.Technion.AC.IL>
Dear list,
Can anyone refer me to C/C++ code that implements a heuristic for
packing axis-parallel rectangles in an axis-parallel rectangular container?
Many thanks,
Gill
---------------------------------------------------------------------------
Gill Barequet Phone: +972-4-829-3219
Faculty of Computer Science Fax: +972-4-822-1128
(Rm.: [New] Taub 516) E-mail: barequet@cs.technion.ac.il
The Technion---IIT WWW: http://www.cs.technion.ac.il/~barequet
Haifa 32000 http://myprofile.cos.com/barequet
Israel
"Life is NP-Hard." (-)
-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request@research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.
From mdrinto at sandia.gov Tue Jul 10 21:04:59 2001
From: mdrinto at sandia.gov (Rintoul, Mark Daniel)
Date: Mon Jan 9 13:41:02 2006
Subject: dist btwn points sbjct to threshold
Message-ID:
If you have the memory, the easiest way is probably just to
superimpose a grid over the particles, and keep track (via pointers
say) of which particles are in each grid cell. Then, you just have
to look in your own grid cell and neighboring ones that could possibly
have a neighbor within the specified distance. By choosing the
grid size appropriately, you can just look in your cell and the
26 neighbor cells. I think the simulation literature just calls
this the "cell-list" method. It's basically just a hashing approach.
Danny
-----Original Message-----
From: Rohit Singh
To: compgeom-discuss@research.bell-labs.com
Sent: 7/9/2001 1:18 AM
Subject: dist btwn points sbjct to threshold
Hi,
This is a newbie question, so I don't know if this is a standard
problem:
I am doing some protein-modeling work. Given a set of points with 3-D
coordinates, I am interested in finding all pairs of points such that
the
distance between the points is less than some threshold distance. This
threshold distance is chosen, independently, on the basis of energy
considerations. For each such pair, I also need the point-point
distance.
The brute force way I am using right now is to go through all pairs of
points and calculate their distance and see if it is less than
threshold.
Of course, one obvious improvement is to keep track, while calculating
the
inter-point distance along each dimension, of the cumulative
square-of-distance (across all the dimensions considered so far) and
stop
as soon as you exceed the square of the threshold. But since I only have
3
dimensions, it doesn't buy me much.
Are there more efficient ways of doing this?
Thanks in advance,
Rohit
-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request@research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.
-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request@research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.
From ph+ at cs.cmu.edu Tue Jul 10 22:19:04 2001
From: ph+ at cs.cmu.edu (Paul Heckbert)
Date: Mon Jan 9 13:41:02 2006
Subject: dist btwn points sbjct to threshold
In-Reply-To:
Message-ID: <000601c109a7$79c88f60$7cd50280@graphics.cs.cmu.edu>
The algorithm you describe takes O(n^2) time, where n is the number of
points, and that is of course the best you can do for arbitrary point sets,
since the output set could be that large, but when you have fairly well
distributed points, as you probably do for protein work, you should be able
to get O(n) performance in practice.
A simple algorithm I've used for related problems is to create a k*k*k grid
of cubes, each of which contains a list of points within it. You could
choose k such that your cube size is proportional to the threshold distance
you're interested in, or if your points are uniformly distributed through
space (probably not true for proteins) you could try k proportional to n^.33
. Using that simple data structure, it is a simple matter of checking a
cube and perhaps some of the neighboring cubes to find all points within a
given distance of some query point. If your points are well-distributed and
you've chosen k appropriately, the average work required for each query will
be O(1), so finding all pairs with distance below threshold will be O(n).
See the paper "Fast Surface Particle Repulsion" at http://www.cs.cmu.edu/~ph
for more details on the cubical bucketing scheme.
Paul Heckbert
Computer Science Dept
Carnegie Mellon University
> -----Original Message-----
> From: Rohit Singh [mailto:rohitsi@CS.Stanford.EDU]
> Sent: Monday, July 09, 2001 3:18 AM
> To: compgeom-discuss@research.bell-labs.com
> Subject: dist btwn points sbjct to threshold
>
> I am doing some protein-modeling work. Given a set of points with 3-D
> coordinates, I am interested in finding all pairs of points such that the
> distance between the points is less than some threshold distance. This
> threshold distance is chosen, independently, on the basis of energy
> considerations. For each such pair, I also need the point-point distance.
> The brute force way I am using right now is to go through all pairs of
> points and calculate their distance and see if it is less than threshold.
> Of course, one obvious improvement is to keep track, while calculating the
> inter-point distance along each dimension, of the cumulative
> square-of-distance (across all the dimensions considered so far) and stop
> as soon as you exceed the square of the threshold. But since I only have 3
> dimensions, it doesn't buy me much.
>
> Are there more efficient ways of doing this?
-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request@research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.
From Frederic.Cazals at sophia.inria.fr Thu Jul 12 11:34:23 2001
From: Frederic.Cazals at sophia.inria.fr (Frederic Cazals)
Date: Mon Jan 9 13:41:02 2006
Subject: dist btwn points sbjct to threshold
In-Reply-To: <000601c109a7$79c88f60$7cd50280@graphics.cs.cmu.edu>; from ph+@cs.cmu.edu on Tue, Jul 10, 2001 at 09:19:04PM -0400
References: <000601c109a7$79c88f60$7cd50280@graphics.cs.cmu.edu>
Message-ID: <20010712103423.A11064@neiges.inria.fr>
Dear All,
as a follow-up to the discussion regarding bucket-based strategies to
retrieve the pairs of points whose distance is less than a given
threshold, some variants of uniform grids deserve a quote. uniform
grids indeed solve the problem efficiently (theoretically and
practically) as long as the points' distribution is uniform. if not,
variants (in particular recursive grids) are a better choice. the
following bibliography discusses some of these issues:
@book{d-lnba-86
, author = "L. Devroye"
, title = "Lecture Notes on Bucket Algorithms"
, publisher = "Birkh{\"a}user Verlag"
, address = "Boston, MA"
, year = 1986
, keywords = "book"
}
@inproceedings{cp-blspd-97
, author = "F. Cazals and C. Puech"
, title = "Bucket-like space partitioning data structures with applications to ra
y tracing"
, booktitle = "Proc. 13th Annu. ACM Sympos. Comput. Geom."
, year = 1997
, pages = "11--20"
, cites = "a-fcagi-94, aeiim-pubtc-85, c-cpoda-97, cdp-fchcn-95, cs-sigte-97, bko
s-cge-95, d-lnba-86, d-mddtd-88, glm-othsr-96, jl-rrt-92, ks-frtua-97, bwy-oetac-80, mm
s-qsrs-94, nhs-gfasm-84, o-cgc-94, ps-cgi-85, s-iggp-76, s-igbmf-93, sd-fbcve-95, sd-cs
dta-95, w-ltsbv-92, ZZZ"
, update = "98.07 bibrelex, 97.07 efrat"
}
@inproceedings{ho-smhsr-94
, author = "D. Halperin and M. H. Overmars"
, title = "Spheres, Molecules, and Hidden Surface Removal"
, booktitle = "Proc. 10th Annu. ACM Sympos. Comput. Geom."
, year = 1994
, pages = "113--122"
, cites = "abbkw-pdb-87, bkwmbrkst-pdbcb-77, cegs-sessr-91, cegsw-ccbac-90, c-sas
pn-83, b-rsdoh-93, dkmmrt-dphul-88, fp-eagcs-93, fo-fdmm-, gs-pmgsc-85, s-hb-70, kos-eh
sro-92, klps-ujrcf-86, lr-ipses-71, mmpssw-ftdlm-91, m-ms-90, o-plfs-92, ps-cgi-85, s-a
tubl-93, sho-cfsrm-93, vb-facrs-93, ZZZ"
, update = "98.03 bibrelex, 94.09 jones, 94.01 jones"
}
Frederic Cazals.
On Tue, Jul 10, 2001 at 09:19:04PM -0400, Paul Heckbert wrote:
> The algorithm you describe takes O(n^2) time, where n is the number of
> points, and that is of course the best you can do for arbitrary point sets,
> since the output set could be that large, but when you have fairly well
> distributed points, as you probably do for protein work, you should be able
> to get O(n) performance in practice.
>
> A simple algorithm I've used for related problems is to create a k*k*k grid
> of cubes, each of which contains a list of points within it. You could
> choose k such that your cube size is proportional to the threshold distance
> you're interested in, or if your points are uniformly distributed through
> space (probably not true for proteins) you could try k proportional to n^.33
> . Using that simple data structure, it is a simple matter of checking a
> cube and perhaps some of the neighboring cubes to find all points within a
> given distance of some query point. If your points are well-distributed and
> you've chosen k appropriately, the average work required for each query will
> be O(1), so finding all pairs with distance below threshold will be O(n).
>
> See the paper "Fast Surface Particle Repulsion" at http://www.cs.cmu.edu/~ph
> for more details on the cubical bucketing scheme.
>
> Paul Heckbert
> Computer Science Dept
> Carnegie Mellon University
--
------------------------------------ ---------------- -------- ---- -- -
-- Project PRISME, INRIA Sophia-Antipolis, 2004 route des Lucioles,
-- BP 93, F-06902 Sophia-Antipolis,
-- Tel: 33 (0)4 92 38 71 88, Fax: 33 (0)4 92 38 76 43
-- Frederic.Cazals@sophia.inria.fr, http://www.inria.fr/prisme
-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request@research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.
From eppstein at ics.uci.edu Wed Jul 11 16:48:36 2001
From: eppstein at ics.uci.edu (David Eppstein)
Date: Mon Jan 9 13:41:02 2006
Subject: dist btwn points sbjct to threshold
In-Reply-To:
Message-ID: <1865525.3203855316@hyperbolic.ics.uci.edu>
On 7/9/01 12:18 AM -0700, Rohit Singh wrote:
> I am doing some protein-modeling work. Given a set of points with 3-D
> coordinates, I am interested in finding all pairs of points such that the
> distance between the points is less than some threshold distance.
This can be solved in time O(n log n + k) where k is the number of output
points. I think the first paper to do this may be Bentley, Stanat, and
Williams, "The complexity of finding fixed radius near neighbors", Inf.
Proc. Lett. 6:209-213, 1977. Another algorithm is included in my paper
with Dickerson, "Algorithms for proximity problems in higher dimensions",
Comp. Geom. Th. & Appl. 5:277-291, 1996,
http://www.ics.uci.edu/~eppstein/pubs/DicEpp-CGTA-96.pdf
I don't know about the practicality or available implementations of these
algorithms, though.
--
David Eppstein UC Irvine Dept. of Information & Computer Science
eppstein@ics.uci.edu http://www.ics.uci.edu/~eppstein/
-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request@research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.
From mra5577 at cis.ksu.edu Thu Jul 12 23:15:11 2001
From: mra5577 at cis.ksu.edu (Mantena V Raju)
Date: Mon Jan 9 13:41:02 2006
Subject: Lower bound on Computation of 2d voronoi diagrams
In-Reply-To: <200107110458.XAA14867@rigel.cis.ksu.edu>
Message-ID:
The lower bound for computing voronoi diagrams is bigomega(n log n). The
reason cited for this is that
The problem of sorting n real number is reducible to the problem of
computing Voronoi diagrams. This is stated on page 151 of the book
COMPUTATIONAL GEOMETRY AND APPLICATIONS
2nd EDITION by M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf
I don't quite figure out how sorting of n real number is reducible to
finding the voronoi diagram of n sites.
Thanks,
Raju
-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request@research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.
From barequet at cs.Technion.AC.IL Sun Jul 15 12:23:30 2001
From: barequet at cs.Technion.AC.IL (Gill Barequet)
Date: Mon Jan 9 13:41:02 2006
Subject: Lower bound on Computation of 2d voronoi diagrams
Message-ID: <200107150823.LAA23290@cs.Technion.AC.IL>
> From compgeom-owner@research.bell-labs.com Sat Jul 14 19:10 IDT 2001
> X-Authentication-Warning: pollux.cis.ksu.edu: mra5577 owned process doing -bs
> Date: Thu, 12 Jul 2001 22:15:11 -0500 (CDT)
> From: Mantena V Raju
> To: compgeom-discuss@research.bell-labs.com
> Subject: Lower bound on Computation of 2d voronoi diagrams
> MIME-Version: 1.0
>
> The lower bound for computing voronoi diagrams is bigomega(n log n). The
> reason cited for this is that
>
> The problem of sorting n real number is reducible to the problem of
> computing Voronoi diagrams. This is stated on page 151 of the book
>
> COMPUTATIONAL GEOMETRY AND APPLICATIONS
> 2nd EDITION by M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf
>
> I don't quite figure out how sorting of n real number is reducible to
> finding the voronoi diagram of n sites.
>
> Thanks,
> Raju
Given a set I of n integer numbers, construct a set S of 2D points in the
following manner: for each number i in I, put the point (i,0) in S.
Now, from VD(S) you can obtain the sorted I in O(n) time: find the minimum
in I in O(n) time, find its counterpart in S and its record in VD(S) in
O(1) time, and follow the neighborhood relations in VD(S), each in O(1)
time for a total of O(n) time. This will give you the sorted I.
Gill
-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request@research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.
From pankaj at cs.duke.edu Wed Jul 18 10:01:02 2001
From: pankaj at cs.duke.edu (Pankaj Kumar Agarwal)
Date: Mon Jan 9 13:41:02 2006
Subject: CG Steering Cmt Election
Message-ID: <200107181301.JAA28875@kant.cs.duke.edu>
To all members of the Computational Geometry community:
Twenty three people have been nominated and agreed to stand for
election to the Computational Geometry Steering Committee. Their names
are listed below in alphabetical order. We now solicit votes from the
community to elect five among this list for a two-year appointment to
the Steering Committee. We'll use the simplest voting scheme:
The five with the most votes become the new committee.
(I'll not vote except to break ties at the 5th place if that
occurs.)
Here is how to vote. Send one email message to:
pankaj@cs.duke.edu
with the string "vote" or "voting" (case insensitive) in the Subject line.
In the body of the email, include at most five names from the list below.
Please vote for no more than five; you may vote for fewer. Note that you
do not specify offices, which will be determined by the committee. Nor do
you specify a priority or preference or ordering; all votes are counted
equally.
All votes received prior to
12:00AM EDT (U.S.) August 7, 2001
will count toward the election. The results will be reported to this list
soon afterwards.
We look forward to receiving your votes!
Pankaj K. Agarwal
==========================================
Nina Amenta, University of Texas, Austin
Nancy Amato, University of Texas A&M
Boris Aronov, Polytechnic University
Gill Barequet, Technion
Marshall Bern, Xerox
Herve Bronnimann, Polytechnic University
Timothy Chan, University of Waterloo
Danny Chen, University of Notre Dame
Erik Demaine, University of Waterloo
Tamal Dey, Ohio State University
Alon Efrat, University of Arizona
David Eppstein, University of California, Irvine
Jeff Erickson, University of Illionois at Urbana
Steve Fortune, Bell Labs
Leonidas Guibas, Stanford University
Dan Halperin, Tel Aviv University
Marc van Kreveld, Utrecht University
Der-Tsai Lee, Northwestern University and Academia Sinica, Taiwan
Kurt Mehlhorn, MPI Saarbruecken
Joseph Mitchell, SUNY StonyBrook
David Mount, University of Maryland
Diane Souvaine, Tufts University
Subhash Suri, University of California, Santa Barbara
================================================================
Optional Statements
Gill Barequet:
--------------
I will put my efforts in tightening the relations between our
community and industry, in terms of joint projects, technology
transfer, funding, and mutual awareness.
Danny Chen:
----------
One of my main goals is to help foster more connections between
computational geometry and other applied and theoretical areas.
Some of my recent research has been involved with applied areas,
such as medicine, image processing, data mining, and networking.
On one hand, I found it fascinating because computational geometry
techniques often help solve applied problems in a significantly
better manner. Yet on the other hand, I have been repeatedly
frustrated because it was not clear to me how to use geometric
methods to ``move'' the more relevant cases in practical applications.
In answering challenges from real applications, geometric techniques
have both power and shortcomings. I view these as good opportunities
to gain a better status for the computational geometry community.
Our research work can become more relevant to other areas, and
our theoretical study can be enriched and prodded by new sources
and new types of problems.
-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request@research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.
From ziegler at math.TU-Berlin.DE Thu Jul 19 18:50:07 2001
From: ziegler at math.TU-Berlin.DE (Guenter M. Ziegler)
Date: Mon Jan 9 13:41:02 2006
Subject: Fallschool on Triangulations
Message-ID: <15191.431.157022.145669@c3po.math.TU-Berlin.DE>
----------------------------------------------------------------------------
European Graduate Program
Berlin ------------------------------------------ Zurich
Combinatorics, Geometry, and Computation
----------------------------------------------------------------------------
In connection with the European Graduate Program ``Combinatorics,
Geometry, and Computation'' a Fall School
Discrete Geometry - Triangulations from
various points of view
will be held from Saturday, October 4 to 6, 2001 in Alt Ruppin,
a nice little town in the vicinity of Berlin.
It will be funded/financed by the Berlin-Zurich European Graduate Program.
(http://www.inf.fu-berlin.de/gk-cgc/index_bln.html).
The purpose of the Fall School is to give an introductory overview of
several areas of Discrete Geometry and present new research trends, and
to give students working in this or related fields the opportunity to meet.
The school is addressed to graduate students (from all over Europe)
of Mathematics or Computer Science who are interested in Discrete Geometry.
There will be spaces also for some advanced undergraduates
and/or a few postdocs.
Some basic knowledge in Discrete Mathematics/Geometry is assumed.
Students of other fields are welcome to apply if they have this
prerequisite knowledge.
The program will be presented by the following lecturers:
Emo Welzl (ETH Z"urich)
J"org Rambau (ZIB Berlin)
J"urgen Richter-Gebert (TU Munich)
Jack Snoeyink (UNC Chapel Hill)
G"unter M. Ziegler (TU Berlin)
The lectures will present examples, mathematical models,
combinatorial and metric properties, as well as
algorithmic treatment and appliciations of triangulations.
A more detailed program will be available at the WWW site of
the Graduiertenkolleg soon
(http://www.math.tu-berlin.de/~ziegler/fallschool3.html).
Each lecturer will present a lecture of two hours in English.
In addition, problem sets will be solved in small groups and discussed
afterwards.
The Fall School will take place in Alt Ruppin:
Hotel Am Alten Rhin
Fr.-Engels-Str. 12
16827 Alt Ruppin
The costs per participant are DEM 150,00 and include full board during
the Fall School. The number of participants is limited to about 30.
Applications with a short curriculum vitae (including scientific
background) and a short letter of recommendation of a university
faculty member should be sent to:
Prof. G"unter M. Ziegler
Institute of Mathematics, MA 6-2
Technical University of Berlin
D-10623 Berlin
Germany
email: ziegler@math.tu-berlin.de
http://www.math.tu-berlin.de/~ziegler
Tel.: +49 - 30 - 314-25730 office
Tel.: +49 - 30 - 314-23354 Secr.
FAX: +49 - 30 - 314-21269
no later than August 30.
Further information can also be obtained from Bettina Felsner
(phone: 030-838 75-104; e-mail: bfelsner@inf.fu-berlin.de)
-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request@research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.
From taubin at bologna.vision.caltech.edu Thu Jul 19 19:39:57 2001
From: taubin at bologna.vision.caltech.edu (Gabriel Taubin)
Date: Mon Jan 9 13:41:02 2006
Subject: REMINDER : Graphics Models, Special Issue on Processing of Large Polygonal Meshes
Message-ID: <00a201c110bd$3a867c00$0286d783@mesh>
------ REMINDER -----
GRAPHICS MODELS
http://www.academicpress.com/gmod
Special Issue on
Processing of Large Polygonal Meshes
Guest Editor
GABRIEL TAUBIN
California Institute of Technology
and
IBM T.J. Watson Research Center
Very large polyhedral models, which are used in more and more in
graphics applications today, are routinely generated by a variety
of methods such as surface reconstruction algorithms from 3D
scanned data, iso-surface construction algorithms from volumetric
data, and photogrametric methods from aerial photography. The
special issue will focus on methods designed to smooth, denoise,
edit, compress, transmit, and animate very large polygonal meshes,
based on signal processing techniques, constrained energy
minimization, and the solution of diffusion differential equations.
Examples of topics of interest include, but are not limited to:
- Representation and operations on large polygonal meshes
- Connectivity operators
- Geometry operators
- Linear and non-linear Smoothing techniques
- Filtering of normal and tensor fields
- Anisotropic diffusion on meshes
- Mesh sampling rate conversion / resampling
- Curvature-based resampling
- Fourier analysis on meshes and linear filter design
- Mesh fairing by constrained energy minimization
- Mesh fairing by solving PDEs
- Multiresolution representations, editing, and smoothing
- Applications to subdivision surfaces
- Applications to 3D geometry compression / progressive transmission
- Dynamic meshes
Prospective authors are encouraged to submit high quality, original
works which have not appeared, nor are under consideration, in any
other journals.
Dates:
+ Submission Deadline: 09/15/2001
+ Reviews returned to Authors: 12/31/2001
+ Revised paper due by: 01/31/2002
+ Acceptance decisions due by: 02/15/2002
+ Final version due by: 02/28/2002
+ Planned publication date: 07/2002
Electronic Submission :
Papers should be submitted electronically in PDF format.
Send your submission as an attachement by email to taubin@us.ibm.com
Three hard-copy printouts exactly matching the electronic file
must be supplied as well.
Academic Press (AP) encourages all of its authors to prepare and
transmit their manuscripts and associated materials electronically.
Information about preparation of electronic files can be found here
http://www.academicpress.com/www/journal/esub.htm
-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request@research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.
From mjuenger at informatik.uni-koeln.de Tue Jul 24 19:47:17 2001
From: mjuenger at informatik.uni-koeln.de (Michael Juenger)
Date: Mon Jan 9 13:41:02 2006
Subject: GD2001 Call for Participation
Message-ID: <15197.42645.797983.191167@informatik.uni-koeln.de>
***********************************************************************
*** ***
***** Call for Participation *****
****** ******
******* G R A P H D R A W I N G 2 0 0 1 *******
******** ********
******** September 23-26, 2001, Vienna, Austria ********
******** ********
******* Early Registration Deadline: August 8, 2001 *******
****** ******
***** http://www.ads.tuwien.ac.at/gd2001 *****
*** ***
***********************************************************************
****** Invited Lectures ******
Alexander Schrijver, CWI Amsterdam: Graph Drawing and Eigenvalues
Eduard Groeller, TU Vienna: Insight into Data Through Visualization
****** Conference Organization ******
Petra Mutzel, Vienna University of Technology
Michael Juenger, University of Cologne
jointly with the Austrian Academy of Sciences
****** Program ******
_____________________________________________________________________
| |
|Monday, 24 September 2001 |
|---------------------------------------------------------------------|
|09:00 - 09:15|Opening |
|---------------------------------------------------------------------|
|Hierarchical Drawing Chair: Petra Mutzel |
|---------------------------------------------------------------------|
|09:15 - 09:40|V. Dujmovic, M. Fellows, M. Hallett, M. Kitching, |
| |G. Liotta, C. McCartin, N. Nishimura, P. Ragde, |
| |F. Rosamond, M. Suderman, S. Whitesides, D. R. Wood |
| |A Fixed-Parameter Approach to Two-Layer Planarization |
|-------------|-------------------------------------------------------|
|09:40 - 10:00|P. Healy, N. S. Nikolov |
| |How to Layer a Directed Acyclic Graph |
|-------------|-------------------------------------------------------|
|10:00 - 10:20|U. Brandes, B. K?pf |
| |Fast and Simple Horizontal Coordinate Assignment |
|-------------|-------------------------------------------------------|
|10:20 - 10:40|J. M. Six, I. G. Tollis |
| |Automated Visualization of Process Diagrams |
|---------------------------------------------------------------------|
|Coffee Break |
|---------------------------------------------------------------------|
|Planarity Chair: Yefim Dinitz |
|---------------------------------------------------------------------|
|11:10 - 11:30|G. Di Battista, W. Didimo, A. Marcandalli |
| |Planarization of Clustered Graphs |
|-------------|-------------------------------------------------------|
|11:30 - 11:55|K. Edwards, G. Farr |
| |An Algorithm for Finding Large Induced Planar Subgraphs|
|-------------|-------------------------------------------------------|
|11:55 - 12:20|H. de Fraysseix, P. O. de Mendez |
| |A Characterization of DFS Cotree Critical Graphs |
|---------------------------------------------------------------------|
|Lunch |
|---------------------------------------------------------------------|
|Invited Presentation Chair: Michael J?nger |
|---------------------------------------------------------------------|
|14:00 - 15:00|Alexander Schrijver |
| |Graph Drawing and Eigenvalues |
|---------------------------------------------------------------------|
|Coffee Break |
|---------------------------------------------------------------------|
|Crossing Theory Chair: Herbert Fleischner |
|---------------------------------------------------------------------|
|15:30 - 15:55|H. Djidjev, I. Vrto |
| |An Improved Lower Bound for Crossing Numbers |
|-------------|-------------------------------------------------------|
|15:55 - 16:20|P. Hlineny |
| |Crossing-Critical Graphs and Path-Width |
|-------------|-------------------------------------------------------|
|16:20 - 16:40|X. Munoz, W. Unger, I. Vrto |
| |One Side Crossing Minimization is NP-hard for Forests |
| |of Stars of Degree 4 |
|---------------------------------------------------------------------|
|Coffee Break |
|---------------------------------------------------------------------|
|Compaction Chair: Michael Goodrich |
|---------------------------------------------------------------------|
|17:10 - 17:30|M. Eiglsperger, M. Kaufmann |
| |Fast Compaction for Orthogonal Drawings with Vertices |
| |of Prescribed Size |
|-------------|-------------------------------------------------------|
|17:30 - 17:50|C. Binucci, W. Didimo, G. Liotta, M. Nonato |
| |Labeling Heuristics for Orthogonal Drawings |
|_____________|_______________________________________________________|
_____________________________________________________________________
| |
|Tuesday, 25 September 2001 |
|---------------------------------------------------------------------|
|Planar Graphs Chair: Jan Kratochvil |
|---------------------------------------------------------------------|
|09:00 - 09:20|J. Pach, G. Tardos ? |
| |Untangling a Polygon |
|-------------|-------------------------------------------------------|
|09:20 - 09:45|C. A. Duncan, A. Efrat, S. G. Kobourov, C. Wenk |
| |Drawing with Fat Edges |
|---------------------------------------------------------------------|
|Symmetries Chair: Hubert de Fraysseix |
|---------------------------------------------------------------------|
|09:45 - 10:10|C. Buchheim, M. J?nger |
| |Detecting Symmetries by Branch & Cut |
|-------------|-------------------------------------------------------|
|10:10 - 10:35|S.-H. Hong |
| |Drawing Graphs Symmetrically in Three Dimensions |
|---------------------------------------------------------------------|
|Coffee Break |
|---------------------------------------------------------------------|
|Interactive Drawings Chair: Brendan Madden |
|---------------------------------------------------------------------|
|11:05 - 11:30|H. A. D. do Nascimento, P. Eades |
| |User Hints for Directed Graph Drawing |
|-------------|-------------------------------------------------------|
|11:30 - 11:50|C. Friedrich, M. E. Houle |
| |Graph Drawing in Motion II |
|-------------|-------------------------------------------------------|
|11:50 - 12:10|S. C. North, G. Woodhull |
| |On-line Hierarchical Graph Drawing |
|---------------------------------------------------------------------|
| Lunch |
|---------------------------------------------------------------------|
|14:00 - 16:00|Software Exhibition (program see below) |
| | |
|---------------------------------------------------------------------|
|Representations Chair: Franz Aurenhammer |
|---------------------------------------------------------------------|
|16:00 - 16:25|J. Pach, G. Toth |
| |Recognizing String Graphs is Decidable |
|-------------|-------------------------------------------------------|
|16:25 - 16:45|J. Cerny, D. Kral, H. Nyklova, O. Pangrac |
| |On Intersection Graphs of Segments with Prescribed |
| |Slopes |
|---------------------------------------------------------------------|
|Coffee Break |
|---------------------------------------------------------------------|
|History & Aesthetics Chair: Peter Eades |
|---------------------------------------------------------------------|
|17:15 - 17:40|E. Kruja, A. Blair, J. Marks, R. Waters |
| |A Short Note on the History of Graph Drawing |
|-------------|-------------------------------------------------------|
|17:40 - 18:00|J. Adamec, J. Nesetril |
| |Towards an Aesthetic Invariant for Graph Drawing |
|-------------|-------------------------------------------------------|
| 18:30 |Bus to Klosterneuburg |
| |Conference Dinner |
| | |
| |Graph Drawing Contest Chair: Franz Brandenburg |
|_____________|_______________________________________________________|
_____________________________________________________________________
| |
|Wednesday, 26 September 2001 |
|---------------------------------------------------------------------|
|2D- and 3D-Embeddings Chair: Shin-ichi Nakano |
|---------------------------------------------------------------------|
|09:00 - 09:25|T. Biedl, J. R. Johansen, T. Shermer, D. R. Wood |
| |Orthogonal Drawings With Few Layers |
|-------------|-------------------------------------------------------|
|09:25 - 09:50|D. R. Wood |
| |Bounded Degree Book Embeddings and Three-Dimensional |
| |Orthogonal Graph Drawing |
|-------------|-------------------------------------------------------|
|09:50 - 10:15|S. Felsner, G. Liotta, S. Wismath |
| |Straight Line Drawings on Restricted Integer Grids in |
| |Two and Three Dimensions |
|-------------|-------------------------------------------------------|
|10:15 - 10:40|R. Babilon, J. Matousek, J. Maxova, P. Valtr |
| |Low-Distortion Embeddings of Trees |
|---------------------------------------------------------------------|
|Coffee Break |
|---------------------------------------------------------------------|
|Invited Presentation Chair: Petra Mutzel |
|---------------------------------------------------------------------|
|11:00 - 12:00|Eduard Gr?ller |
| |Insight into Data Through Visualization |
|---------------------------------------------------------------------|
|Lunch |
|---------------------------------------------------------------------|
|Floor-Planning Chair: Therese Biedl |
|---------------------------------------------------------------------|
|14:00 - 14:25|C.-C. Liao, H.-I Lu, H.-C. Yen |
| |Floor-Planning via Orderly Spanning Tree |
|-------------|-------------------------------------------------------|
|14:25 - 14:45|K. Freivalds, U. Dogrusoz, P. Kikusts |
| |Disconnected Graph Layout and the Polyomino Packing |
| |Approach |
|-------------|-------------------------------------------------------|
|Planar Drawing Chair: Giuseppe Di Battista |
|---------------------------------------------------------------------|
|14:45 - 15:10|Md. S. Rahman, M. Naznin, T. Nishizeki |
| |Orthogonal Drawings of Plane Graphs Without Bends |
|-------------|-------------------------------------------------------|
|15:10 - 15:35|C. A. Duncan, S. G. Kobourov |
| |Polar Coordinate Drawing of Planar Graphs with Good |
| |Angular Resolution |
|---------------------------------------------------------------------|
|Coffee Break |
|---------------------------------------------------------------------|
|16:00 - 17:00|Special Session on Graph Exchange Formats |
| |Chair: Giuseppe Liotta |
|-------------|-------------------------------------------------------|
| 17:00 |Closing |
|_____________|_______________________________________________________|
=================================================================
_____________________________________________________________________
| |
|Software Exhibition Tuesday, 26 September 2001, 14:00 - 16:00 |
|---------------------------------------------------------------------|
|D. Auber |
|Tulip, a Huge Graphs Visualization Software |
| |
|G. Sander, A. Vasiliu |
|The ILOG JViews Graph Layout Module |
| |
|E. Di Giacomo, G. Liotta |
|Graph Drawing Animation over the Internet |
| |
|T. Dwyer, P. Eckersley |
|Wilmascope Interactive 3D Graph Visualisation System |
| |
|G. Barbagallo, A. Carmignani, G. Di Battista, W. Didimo, M. Pizzonia |
|Exploration and Visualization of Computer Networks: Polyphemus and |
|Hermes |
| |
|C. Lewerentz, F. Simon, F. Steinbr?ckner |
|3D Visualization of Large Object-Oriented Programs |
| |
|G. Barequet, S. Bridgeman, C. Duncan, A. Garg, M. Goodrich, |
|R. Tamassia |
|The Graph Drawing Server |
| |
|G. Di Battista, W. Didimo, M. Patrignani, M. Pizzonia |
|Drawing Database Schemas with DBdraw |
| |
|J. Delahousse, P. Auillans |
|Graph Drawing for Topic Maps and Semantic Network |
| |
|R. Wiese, M. Eiglsperger, M. Kaufmann |
|yFiles: Visualization and Automatic Layout of Graphs |
| |
|F. J. Brandenburg, M. Forster, A. Pick, M. Raitner, F. Schreiber |
|BioPath - Visualization of Biochemical Pathways |
| |
|F. Bertault, W. Feng, U. Foessmeier, G. Grigorescu, B. Madden |
|Graph Visualization API Library Technology for Application Builders |
| |
|J. Bagga, A. Heinz |
|JGraph - A Java System for Drawing Graphs and Running Algorithms |
| |
|C. Gutwenger, M. J?nger, K. Klein, J. Kupke, S. Leipert, P. Mutzel |
|Automatic Layout of UML Class Diagrams |
| |
|M. Baur, M. Benkert, U. Brandes, S. Cornelsen, M. Gaertler, B. K?pf, |
|J. Lerner, D. Wagner |
|visone - Software for Visual Social Network Analysis |
| |
|U. Lauther, A. Stuebinger |
|Generating Schematic Maps using Springembedder Methods |
| |
|H. Eichelberger |
|UML Class Diagrams via SugiBib |
| |
|P. Auillans, J. Delahousse |
|Mondeca Topic Maps Software and Graph Drawing |
| |
|G. Hotz, S. Lohse |
|Planarity Testing of Graphs on Base of a Spring Model |
| |
|D. Alberts, D. Ambras, R. Brockenauer, C. Buchheim, M. Elf, |
|S. Fialko, C. Gutwenger, M. J?nger, G. W. Klau, K. Klein, G. Koch, |
|T. Lange, S. Leipert, D. Luetke-Huettmann, P. Mutzel, S. Naeher, |
|R. Weiskircher, T. Ziegler |
|AGD - A Library of Algorithms for Graph Drawing |
| |
|W. Didimo, M. Patrignani, M. Pizzonia |
|Industrial Plant Drawer |
| |
|V. Batagelj, A. Mrvar |
|Pajek - Analysis and Visualization of Large Networks |
| |
|K. Ryall |
|GLIDE |
| |
|R. Castello, R. Mili, I. G. Tollis |
|Visualizing State Charts: The ViSta Tool |
| |
|J. Ellson, E. Gansner, L. Koutsofios, S. North, G. Woodhull |
|Graphviz - Open Source Graph Drawing Tools |
|_____________________________________________________________________|
--
-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request@research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.
From trivino at lcc.uma.es Wed Jul 25 13:03:33 2001
From: trivino at lcc.uma.es (=?iso-8859-1?Q?Jos=E9?= Luis =?iso-8859-1?Q?Trivi=F1o?=)
Date: Mon Jan 9 13:41:02 2006
Subject: ICALP 2002 Call for Papers
Message-ID: <3B5E9975.B5F91CF7@lcc.uma.es>
We apologize for possible multiple postings.
In http://www.lcc.uma.es/icalp2002/c4p-jul01.pdf you can find a pdf
version of this call for paper.
+++++++++++++++++++++++++++++++++++++
Call for Papers
ICALP 2002
29th International Colloquium on
Automata, Languages and Programming
July 8-13, 2002, M?laga, Spain
Camera Ready: April 16, 2002
The 29th annual meeting of the European Association of Theoretical
Computer Science will be held in M?laga, Spain, July 8-13, 2002 (at the
E.T.S. Ingenier?a Inform?tica).
As with the Journal Theoretical Computer Science (TCS), the scientific
program of the Colloquium will be split into two parts: Track A of the
meeting will correspond to Algorithms, Automata, Complexity and Games,
while Track B to Logic, Semantics and Theory of Programming.
SUBMISIONS: Authors are invited to submit extended abstract of their
papers, presenting original contributions to the theory of computer
science. Detailed instructions for paper submissions will be found on
the conference webpage (http://www.lcc.uma.es/icalp2002) and in future
calls for papers. Submissions should consist of: a cover page, with the
author's full name, address, fax number, e-mail address, a 100-word
abstract, keywords and to which track (A or B) the paper is being
submitted and an extended abstract describing original research. At
least one author of an accepted paper should be available to present it
at the conference. Simultaneous submission to other conferences with
published proceedings is not allowed.
Further information (dates and instructions for submissions, workshops,
registration, location and travel) will be provided in future
announcements.
ORGANIZING COMMITEE: Buenaventura Clares (University of Granada),
Ricardo Conejo (University of M?laga), Inmaculada Fortes (University of
M?laga), Llanos Mora (University of M?laga), Rafael Morales (co-Chair,
University of M?laga), Marlon Nu?ez (University of M?laga), Jos? Luis
P?rez de la Cruz (University of M?laga), Gonzalo Ramos (University of
M?laga), Francisco Triguero (co-Chair, University of M?laga), Jos? Luis
Trivi?o (University of M?laga).
IMPORTANT DATES:
Workshops proposal: November 8, 2001
Submissions: January 14, 2002
Notification: March 20, 2002
CONFERENCE CO-CHAIRS
Prof. Francisco Triguero
Prof. Rafael Morales
Universidad de M?laga
E.T.S. Ingenier?a Inform?tica
Dept. Lenguajes y Ciencias de la Computaci?n
Bulevar Louis Pasteur, 35
29071 - M?laga (SPAIN)
e-mail: icalp2002@informatica.uma.es
PROGRAM COMMITEE
Track A
Ricardo Baeza-Yates (U. Chile)
Volker Diekert (U. Stuttgart)
Paolo Ferragina (U. Pisa)
Catherine Greenhill (U. Melbourne)
Torben Hagerup (U. Frankfurt)
Johan H?stad (KTH, Stockholm)
Gabriel Istrate (Los Alamos)
Claire Kenyon (U. Paris XI)
Der-Tsai Lee (Acad. Sinica, Taipei)
Heikki Mannila (Nokia, Helsinki)
Elvira Mayordomo (U. Zaragoza)
Helmut Prodinger (U. Witwatersrand, South Africa)
Jan van Leeuwen(U. Utrecht)
Paul Vit?nyi (CWI, Amsterdam)
Peter Widmayer (ETH Z?rich) (Chair)
Gerhard Woeginger (T.U. Graz)
Christos Zaroliagis (U. Patras)
Track B
Mart?n Abadi (Bell Labs Research, Lucent)
Roberto Amadio (U. Provence)
Gilles Barthe (INRIA-SophiaAntipolis)
Manfred Droste (University of Technology Dresden)
C?dric Fournet (Microsoft Cambridge)
Matthew Hennessy (U. Sussex) (Chair)
Furio Honsell (U. Udine)
Peter O'Hearn (Queen Mary & W. C. London)
Fernando Orejas (U.P.Catalunya)
Ernesto Pimentel (U. M?laga)
David Sands (Chalmers University of Technology and G?teborg University)
Dave Schmidt (U. Kansas)
Gheorghe Stefanescu (U. Bucharest)
Vasco Vasconcelos (U. Lisbon)
Thomas Wilke (U. Kiel)
-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request@research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.
From JC.Spehner at uha.fr Thu Jul 26 18:50:46 2001
From: JC.Spehner at uha.fr (Jean-Claude Spehner)
Date: Mon Jan 9 13:41:02 2006
Subject: Professor and assistant professor positions
Message-ID: <004601c115ea$bbe397b0$3000210a@univmulhouse.fr>
Dear colleagues,
Please find as an attached file announces for a part-time assistant
professor position for september 2001 and
for a professor position for september 2002 in computer science at the
Universite de Haute-Alsace at Mulhouse (France).
Please, distribute this announce arround you to anyone that could be
interested.
Sincerely yours.
Jean-Claude Spehner,
Laboratoire Mage,
Universite de Haute-Alsace,
Mulhouse, France
email: JC.Spehner@uha.fr
tel : (33) 3 89 33 63 50
fax : (33) 3 89 33 60 89
-------------- next part --------------
Announce for a part-time assistant professor position for september 2001 and
for a professor position for september 2002 in computer science at the
Universite de Haute-Alsace at Mulhouse (France).
o Part-time assistant professor position:
A one year part-time position for an invited foreign (i.e., non french)
assistant professor in computer science has been created for the start of the
new academic year (september 2001).
This part-time position will allow the candidate to get familiar with computer
science teaching in french at the Universite de Haute-Alsace (teaching can be
varied from conferences in english for researchers to lectures in french for
french students) and with the research of the laboratory MAGE (computer science
research laboratory of the University). It will also allow the candidate to get
a "qualification", a mandatory certificate for candidating on the professor
position that will be created for september 2002 (see details below on this
position).
The main research themes of the laboratory MAGE are:
- computational geometry in the plane and in the 3D space: convex hulls,
Voronoi and Delaunay diagrams, ...
- 3D modelization: data structures based on the notion of maps and pavings
used for the previous computations and for representing molecular surfaces,
non woven textiles, ...
- modelization and simulation of discrete events driven complex systems:
modelization methodologies, "hybrid" medelization, automatic code
generation from comportemental models, simulation algorithms, ...
- algorithms on words.
o Professor position:
Since the professor position in computer science created for this new academic
year (september 2001) has not been filled, the position will be opened for
recruitment this year (position beginning then in september 2002).
The laboratory MAGE would like to recruit a candidate either in the reseach
themes already evocated, or in research themes closely connected such as
visualization, computer animation, computer graphics, ...
Teaching will be done in french at the Universite de Haute-Alsace, and the
candidate will have to get a "qualification" (a french certificate) to be
allowed to postulate on the position.
Don't hesitate to contact me for further explanations.
Please, distribute this announce arround you to anyone that could be interested.