From heitzig-j at web.de Tue Jun 3 12:57:57 2003
From: heitzig-j at web.de (Jobst Heitzig)
Date: Mon Jan 9 13:41:11 2006
Subject: Q: smallest n-cube containing k points in euclidean n-space?
Message-ID: <3EDC7125.8000003@web.de>
Hello everybody!
Some problems:
Q1: Given k points in Euclidean n-space,
what is the smallest n-cube containing all of them?
Probably equivalent question:
Q2: Given
X = some k-dimensional metric space
Y = n-th power of unit interval, with euclidean metric
Can X be embedded isometrically into Y?
And finally my main problem:
Q3: Given
M = some k-dimensional correlation matrix
(i.e. positive semi-definite, all entries in [-1,1],
unit diagonal)
Y = n-th power of interval [-b,b] for some positive b
Are there k vectors x_1,...,x_k in Y such that
M_ij is the scalar product of x_i and x_j for all i,j?
(In other words: When can we realize a correlation matrix of k variables
with n observations, where the variables satisfy some given bounds?)
Jobst Heitzig,
Statistisches Bundesamt Deutschland
-------------
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 alt at inf.fu-berlin.de Wed Jun 4 16:08:38 2003
From: alt at inf.fu-berlin.de (Helmut Alt)
Date: Mon Jan 9 13:41:11 2006
Subject: open position
Message-ID: <200306041309.h54D9fUx009670@dusty.research.bell-labs.com>
Dear colleagues,
Attached find a word document with the announcement of an open
position for a junior professor in theoretical computer science
at the Free University of Berlin.
-- Helmut Alt
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/octet-stream
Size: 26624 bytes
Desc: Ausschreibung (TheoInf) eng 16.4.03.doc
Url : http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20030604/205956d5/attachment.obj
From hoffkamp at inf.fu-berlin.de Wed Jun 4 16:22:56 2003
From: hoffkamp at inf.fu-berlin.de (Andrea Hoffkamp)
Date: Mon Jan 9 13:41:11 2006
Subject: Doccourse 2004: Program for predoctoral and doctoral students
Message-ID: <20030604132256.GG32041@inf.fu-berlin.de>
Call for Applications
DOCCOURSE BERLIN-PRAGUE 2004
Programme for pre-doctoral and doctoral students in
===================================================
===== Combinatorics, Geometry, and Computation ====
===================================================
January-June 2004
(January 1 - March 31 Prague, April 1 - June 30 Berlin)
http://dimatia.mff.cuni.cz/doccourse
Supported by the the European Graduate Program "COMBINATORICS, GEOMETRY, AND
COMPUTATION", by the EU network COMBSTRU, and by DIMATIA Prague.
The European Graduate Program "COMBINATORICS, GEOMETRY, AND COMPUTATION"
in Berlin and DIMATIA Centre at the Charles University Prague offer
a one-semester study programme for PhD students and students preparing
to enter a PhD programme in areas: Combinatorics and Graph Theory;
Discrete and Computational Geometry; Combinatorial Optimization;
Discrete Structures.
The programme in 2004 includes four research-oriented courses and a project;
see the schedule, speakers (including guests P. Cameron and M. Sharir),
and topics below.
The contact persons and the leaders of the programme are H. Alt (FU Berlin,
alt inf.fu-berlin.de), J. Matousek (Charles University, Prague,
matousek kam.mff.cuni.cz), and J. Nesetril (Charles University,
Prague, nesetril kam.mff.cuni.cz).
A limited number of scholarships of approximately EUR 1000/month
are available for students with a diploma or master degree in a field
related to the topics of the programme (mathematics, computer science).
Advanced diploma or master students can be considered as well
if a feasible arrangement with their home institutions can be made.
Students wishing to participate in the programme using other
financial resources are also encouraged to apply; the acceptance
will be limited by the capacity of the courses.
The accepted students are expected to participate in all of the programme
(January - March in Prague, April - June in Berlin).
Pre-doctoral students may prepare a PhD research proposal
during the programme, and after the programme there is a possibility
of applying for a PhD scholarship at one of the institutions of
the COMBSTRU network or at the graduate programme CGC.
The language of the programme is English. The programme is open
to applicants of all nationalities.
Applications with curriculum vitae, copies of certificates, thesis,
areas of interest, and a letter of recommendation from the thesis
advisor should be sent
either electronically (preferable), in an open format
(Postscript, PDF), to "matousek" at the domain "kam.mff.cuni.cz",
or by mail to
DOCCOURSE
Jiri Matousek
Department of Applied Mathematics
Malostranske nam. 25
118 00 Praha 1
Czech Republic
Application deadlines are July 15, 2003, and September 30, 2003.
Applicants are notified of results about one month after the
respective deadline. This stepwise procedure allows students
to obtain a commitment at an early stage, while leaving some
options also for later applicants.
==============================================================================
COURSES
Courses will be held two days a week, for a five-week period.
Every day includes about 3 hours of lectures, exercises in groups,
and a discussion of exercises.
-----------------------------------------------------------------------------
Permutation groups, structures, and polynomials
------------------------------------------------------------------------------
Peter Cameron (London)
Prague, January - February 2004
Abstract:
The course will begin by discussing the basic concepts of permutation groups,
both finite and infinite. Many examples of infinite permutation groups are
obtained from homogeneous or omega-categorical structures, and the course
will describe some of these. Finite permutation groups occur in enumeration
theory; the cycle index of a permutation group has some connections with the
Tutte polynomial of a matroid. The theory of species relates these two
areas, studying an infinite structure by its finite subsets.
------------------------------------------------------------------------------
Arrangements in Computational and Combinatorial Geometry
------------------------------------------------------------------------------
Micha Sharir (Tel Aviv)
Prague, January - February 2004
Abstract:
The course studies combinatorial and algorithmic problems related to
arrangements of curves and surfaces in the plane and in higher dimensions.
Arrangements arise in many applications, and have a rich combinatorial
structure. The topics covered by the course include the study of substructures
in arrangements, such as lower envelopes, single cells, zones, levels,
and more; Davenport-Schinzel sequences; Algorithms for 2-dimensional
arrangements; The Zone Theorem in higher dimensions; Randomized techniques
in geometry; Incidences between points and curves; Geometric partitioning
and range searching.
------------------------------------------------------------------------------
Convex Polytopes
------------------------------------------------------------------------------
Guenter M. Ziegler (TU Berlin)
Berlin, April - May 2004
Abstract:
This will be a ``steep'' but hands-on introduction to the theory of convex
polytopes and their combinatorial properties. This will start with an
extensive discussion and analysis of examples. On this basis we will develop
the fundamental combinatorial facts (face lattices, polarity). Then we
concentrate on 3-dimensional polytopes (rather well-understood) and on
4-dimensional polytopes (active field of research). A survey of f-vector
theory will lead us to discuss ``extremal'' polytopes.
------------------------------------------------------------------------------
Random generation and approximate counting
------------------------------------------------------------------------------
Volker Kaibel (TU Berlin)
Berlin, April - May 2004
Abstract:
The first part of the course will be an introduction to the theory of
random walks for generating combinatorial objects randomly with a
prescribed distribution. In particular, we will focus on methods for
analyzing the speed of convergence of Markov chains on finite state
spaces (like 'canonical paths' and 'coupling from the past').
In the second part, the tools developed in the first part will be
exploited in order to build algorithms for randomized approximate
counting of combinatorial objects. Among the topics will be recent
achievements such as the randomized approximation algorithm for
computing the permanent, due to Jerrum, Sinclair and Vigoda (2001).
------------------------------------------------------------------------------
-------------
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 fernando_cacciola at hotmail.com Tue Jun 10 17:42:47 2003
From: fernando_cacciola at hotmail.com (Fernando Cacciola (h))
Date: Mon Jan 9 13:41:11 2006
Subject: How to turn complex polygon into simple polygon?
References:
Message-ID:
Greetings,
The Eppstein's and Erickson's paper "Raising Roofs, Crashing Cycles and
Playing Pool" present an algorithm for the construction of the straight
skeleton of arbitrary planar figures.
The paper identifies a special degenerate case were two or more split events
reach the same point simultaneously (and nothing else), defining a special
kind of event called a "vertex event".
For robustness reasons, I'm trying to figure out a definition of vertex
event which does not involve distance computations between computed points
(i.e: does not check for equality of slit points).
AFAICT, a split event ocurrs when two consecutive edges moving along a
reflex bisector simultaneously hit some oposite edge at a given offset
distance -or instant- 't'.
Thus, a reflex event is given by two consecutive edges EL,ER -called
defining edges- and some oposite edge EO.
My question is: is it true that a vertex event ocurrs ONLY when the oposite
edge of a split event is either one of the defining edges of some other
split event which ocurrs at the same instant, and viceversa?
That is, is it a necessary condition that given split events ((Ei,Ej),En,t)
and ((Ek,El),Em,t),
for them to define a vertex event, 'En' is either 'Ek' or 'El', and 'Em' is
either 'Ei' or 'Ej'.
And is such a condition sufficient?
If such a condition is necessary and sufficient, that is, defines a vertex
event, I think it follows that there can be no more than two split events
collpased as a single vertex event. Or, to put it differently, there must be
an even number of simultaneous split events at the same point, each pair
defining a (topologically) distinct vertex event.
Is this correct?
Thank you.
Fernando Cacciola
-------------
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 fcacciola at gosierra.com Tue Jun 10 17:45:28 2003
From: fcacciola at gosierra.com (Fernando Cacciola)
Date: Mon Jan 9 13:41:11 2006
Subject: How to turn complex polygon into simple polygon?
Message-ID: <011001c32f88$d97fe080$0f00a8c0@fernandoc>
Greetings,
The Eppstein's and Erickson's paper "Raising Roofs, Crashing Cycles and
Playing Pool" present an algorithm for the construction of the straight
skeleton of arbitrary planar figures.
The paper identifies a special degenerate case were two or more split events
reach the same point simultaneously (and nothing else), defining a special
kind of event called a "vertex event".
For robustness reasons, I'm trying to figure out a definition of vertex
event which does not involve distance computations between computed points
(i.e: does not check for equality of slit points).
AFAICT, a split event ocurrs when two consecutive edges moving along a
reflex bisector simultaneously hit some oposite edge at a given offset
distance -or instant- 't'.
Thus, a reflex event is given by two consecutive edges EL,ER -called
defining edges- and some oposite edge EO.
My question is: is it true that a vertex event ocurrs ONLY when the oposite
edge of a split event is either one of the defining edges of some other
split event which ocurrs at the same instant, and viceversa?
That is, is it a necessary condition that given split events ((Ei,Ej),En,t)
and ((Ek,El),Em,t),
for them to define a vertex event, 'En' is either 'Ek' or 'El', and 'Em' is
either 'Ei' or 'Ej'.
And is such a condition sufficient?
If such a condition is necessary and sufficient, that is, defines a vertex
event, I think it follows that there can be no more than two split events
collpased as a single vertex event. Or, to put it differently, there must be
an even number of simultaneous split events at the same point, each pair
defining a (topologically) distinct vertex event.
Is this correct?
Thank you.
Fernando Cacciola
-------------
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 Kashif.Bhatti at student.gu.edu.au Thu Jun 12 22:36:35 2003
From: Kashif.Bhatti at student.gu.edu.au (Kashif Bhatti)
Date: Mon Jan 9 13:41:11 2006
Subject: common intersection of circles
Message-ID: <006b01c330d6$e0ebcbf0$4262ea84@Babangida>
Hello Every one,
I am just trying to solve a similar problem posted earlier, please do reply.
Hello computational poeople,
I have 3 circles, with their centers and radius known. How would I
compute the common area of intersection of the three circles. I am not
sure if my three circles are intersecting at all. If they are intersection
the area formula should give me the value of common area of intersection
else it should return 0. Please advise in that manner.I did a
brief search on NET and was able to find a sampling based method,
which takes a point in random and sees is the point is in the common
area and proceed accordingly. But I need a definitive formula based
approach. Can you please provide me the formula common area of
intersection of three circles. Also provide me links that has the software
implementation of this problem.
Please use this general equation of the circle
(X-a)^2 + (Y-b)^2 = r^2. Where (a,b) is the center of that cicle and r
is its radius.
Thanks in advance.
Happy day,
Karthik
Regards,
Kashif
-------------
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 sca03 at cs.unc.edu Thu Jun 12 03:57:08 2003
From: sca03 at cs.unc.edu (Symposium on Computer Animation)
Date: Mon Jan 9 13:41:11 2006
Subject: ACM SIGGRAPH/Eurographics Symposium on Computer Animation
Message-ID: <200306120657.h5C6v8JR020616@capefear.cs.unc.edu>
Greetings!
This year ACM SIGGRAPH/Eurographics Symposium on Computer Animation
will be co-located with SIGGRAPH, held on Saturday and Sunday before
the main conference, in San Diego, California. The symposium program
is avaiable at:
http://gamma.cs.unc.edu/SCA03/program.htm
Also, the registration website is now open. Please visit
http://gamma.cs.unc.edu/SCA03/
The first 100 registrants will receive a free symposium T-Shirt.
The advanced registration dealine is June 25, 2003.
Rick Parent & Karan Singh
SCA'03 General Co-Chairs
Ming Lin & Dave Breen
SCA'03 Program Co-Chairs
-------------
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 moccozet at miralab.unige.ch Tue Jun 17 14:36:28 2003
From: moccozet at miralab.unige.ch (Laurent Moccozet)
Date: Mon Jan 9 13:41:11 2006
Subject: CfP - CASA2004 / Computer Animation & Social Agents
Message-ID: <5.1.0.14.0.20030617133559.03b226e8@127.0.0.1>
-------- Call for Participation ----------
---------------- CASA2004 ----------------
Computer Animation and Social Agents 2004
>> The Computer Graphics Society is pleased to announce the Computer Animation and Social Agents 2004
Conference. MIRALab will organize this 17th annual conference on Computer Animation and Social Agents with the support of IFIP WG5.10 (Computer Graphics and Virtual Worlds). The Conference will be held in University of Geneva, Switzerland, May 26-27-28, 2004.
Important dates :
2003, October 20: Paper Submission Deadline
2003, December 15: Papers Notification of Acceptance
2004, January 10: Camera Ready Papers Due
2004, May 26: Start of Computer Animation and Social Agents 2004
>> The conference tracks include:
:: Animation Techniques
:: :: Motion control
:: :: Motion capture and retargeting
:: :: Path planning
:: :: Physics-based animation
:: :: Vision techniques in animation
:: :: Behavioral animation
:: :: Artificial life
:: :: Image rendering in animation
:: :: Deformable Models
:: :: Facial Animation
:: Social agents
:: :: Social agents and avatars
:: :: Emotions and personality
:: :: Simulation involving Virtual Humans
:: :: Autonomous characters and actors
:: :: A.I. - based animation
:: :: Social and Conversational agents
:: :: Interagent communication
:: :: Modeling of groups and crowds
:: :: Social behavior
:: :: Autonomous Virtual Humans in games
:: Virtual Environments
:: :: Medical 3D simulation
:: :: Simulation involving Virtual Humans
:: :: Virtual Cultural Heritage
:: :: Autonomous characters and actors
:: :: VCE (Virtual Collaborative Environments)
:: :: A.I. - based animation
:: :: Virtual reality
:: :: Interaction with Virtual Humans
:: :: Augmented Reality
:: :: Perceptual models
:: :: Virtual Sensors
>> Conference Co-Chairs
Nadia Magnenat-Thalmann
University of Geneva,
Switzerland
thalmann@miralab.unige.ch
Sung Yong Shin
Korea Advanced Institute of Science
Technology, Republic of Korea
syshin@jupiter.kaist.ac.kr
>> Program Co-Chairs
> Animation techniques
John A.Vince
Bournemouth University,
Dorset, UK
jvince@bournemouth.ac.uk
> Social agents
Catherine P?lachaud
IUT de Montreuil-
Universit? de Paris 8, France
c.pelachaud@iut.univ-paris8.fr
> Virtual environments
Daniel Thalmann
EPFL, Switzerland
daniel.thalmann@epfl.ch
>> Paper submission procedures:
Submissions are made electronically, in PDF format only (no paper copy will be accepted) at casa2004.miralab.unige.ch. All accepted papers will appear in a proceedings book published by IEEE Computer Society Press.
>> Paper format:
Original unpublished papers of up to 12 pages (single-spaced, 12 point, including figures, tables and references) are invited. Manuscripts must be written in English. The first part of the paper should include a title, an abstract, keywords, and author's information (name, title, affiliation, address, phone and fax numbers, e-mail address). Submission will be online and there will be instructions on the web. Any animation sequences should be uploaded as an archive .zip file with your manuscript.
>> Send Queries to:
Secretariat CASA2004
Email: casa2004@miralab.unige.ch
Fax: +41 22 7057780
Website: casa2004.miralab.unige.ch
>> International Program Committee (Tentative)
E. Andre, University of Augsburg, Germany
N. Badler, University of Pennsylvania, USA
D. Ballin, BTexact Technologies , UK
R. Boulic, Swiss Federal Institute of Technology Lausanne (EPFL), Switzerland
G. Burdea, Rutgers University, USA
M.-P. Cani, National Polytechnic Institute of Grenoble (INPG), France
T. Capin, NOKIA, USA
J. Cassell, MIT, USA
T- S. Chua, National University of Singapore, Singapore
D. Cohen-Or, Tel Aviv University, Israel
A. de Antonio, University Polytechnic of Madrid, Spain
D. DeCarlo, Rutgers University, USA
S. Donikian, Institut de Recherche en Informatique et Syst?mes Al?atoires (IRISA), France
D. Ebert, Purdue University, USA
I. Essa, Georgia Institute of Technology, USA
R. Fedkiw, Stanford University, USA
N. Foster, PDI, USA
M. G?bel, Fraunhofer Institute, Germany
J. Gratch, University of Southern California (USC), USA
J. Hodgins, Carnegie Mellon University, USA
H. Ip, City University of Hong Kong, China
A. Kaufman, State University of New York at Stony Brook (SUNY), USA
P. Kalra, Indian Institute of Technology Delhi (IIT-Delhi), INDIA
S. King, University of Otago, New Zealand
H. Ko, Seoul National University, South Korea
T. L. Kunii, Kanazawa Institute of Technology, Japan
J. Lester, North Carolina State University, USA
M. Lin, University of North Carolina (UNC), USA
N. Magnenat-Thalmann, University of Geneva, Switzerland
D. Manocha, University of North Carolina (UNC), USA
D. Metaxas, Rutgers University, USA
L. Moccozet, University of Geneva, Switzerland
A. Nasri, American University of Beirut, Lebanon
C. O'Sullivan, Trinity College, Dublin, Ireland
D. Pai, Rutgers University, USA
M. van de Panne, University of British Columbia, Canada
R. Parent, Ohio State University, USA
C. P?lachaud, Universit? de Paris 8, France
N. Pollard, Brown University, USA
L. Porcher Nedel, Federal University of Rio Grande do Sul, Brazil
H. Pottmann, Technische Universit?t Wien, Austria
S. Raupp Musse, University do Vale do Rio dos Sinos, Brazil
J. Rickel, University of Southern California, USA
T. Rist, German Research Center for Artificial Intelligence, Germany
S. Rizzo, University of Southern California, USA
R.Scopigno, Istituto di Scienza e Tecnologie dell'Informazione, Italian National Research Council (CNR), Italy
H. P. Seidel, Max-Planck-Institut f?r Informatik, Germany
C. Sidner, Mitsubishi Electric Research Laboratories (MERL), USA
D. Silver, Rutgers University, USA
S. Y. Shin, Korea Advanced Institute of Science and Technology (KAIST), Republic of Korea
J. Stam, Alias Wavefront, USA
H. C. Sun, Rutgers University, USA
D. Terzopoulos, New York University, USA
Daniel Thalmann, Swiss Federal Institute of Technology Lausanne (EPFL), Switzerland
D. Traum, University of Southern California, USA
R. Trappl, Austrian Research Institute for AI, Austria
F. Vexo, Swiss Federal Institute of Technology Lausanne (EPFL), Switzerland
J. A.Vince, Bournemouth University, UK
P.Volino, University of Geneva, Switzerland
Y. Wu, TeraRecon Inc., USA
-----------------------------------------------
Laurent Moccozet, MIRALab - CUI
Laurent.Moccozet@miralab.unige.ch
tel: +41 22 705 76 19 /
fax : +41 22 705 77 80
http://www.miralab.ch/~l.moccozet/
-------------
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 marc at cs.uu.nl Wed Jun 18 18:24:29 2003
From: marc at cs.uu.nl (Marc van Kreveld)
Date: Mon Jan 9 13:41:11 2006
Subject: Minutes of business meeting, SoCG'03
Message-ID: <3EF0842D.30702@cs.uu.nl>
Business meeting at SoCG 2003, San Diego, June 9, 2003
------------------------------------------------------
Minutes of meeting,
by Marc van Kreveld (secretary of steering committee)
Chaired by Joe Mitchell (chair of steering committee)
Joe started the business meeting at 18.10 with a list
of agenda items:
1. Report of Steve Fortune as organizing chair of SoCG'03
2. Report of Dave Mount as PC co-chair (with Mark de Berg)
3. Report of DVD/Video committee chair Erik Demaine
4. SoCG'04 announcement by John Iacono, organizing chair of SoCG'04
5. SoCG'04 announcement by Jack Snoeyink, PC co-chair (with
Jean-Daniel Boissonnat)
6. Location of SoCG'05: presentations for Cracow, Pisa, Japan
7. Announcement by Jeff Erickson about the latex style file
8. Straw vote on color pages in proceedings
1. Steve Fortune reported on SoCG'03. There were 125 attendees,
of which 46 were students, 67 were members of ACM, and 12 were
late registrants.
2. Dave Mount presented the usual, entertaining statistics on
the paper submissions to SoCG this year. There were 118
submissions, of which 42 were accepted (35.5%). Acceptances
in recent years were: 2002: 35; 2001: 39; 2000: 41; 1999: 44.
As the theory and applied tracks have been merged recently, it
is also interesting to consider how many applied/experimental
papers were submitted and accepted. Although it is often hard to
say for several papers whether they are applied or not, Dave
classified 33 out of 118 submissions as applied/experimental,
and 11 of these were accepted.
Dave and Mark were positive about the use of the Echelon system
(developed at the University of Maryland, and likely to have a name
change before public release) for electronic PC discussions. This was
new this year.
They also thanked the many people who contributed to the
conference: the PC (Prosenjit Bose, Erik Demaine, Tamal Dey,
Olivier Devillers, Leo Guibas, Matthew Katz, Joe Mitchell,
Takeshi Tokuyama, Gert Vegter, Emo Welzl, and the co-chairs).
They also thanked all sub-referees and submitters of papers.
3. Erik Demaine reported on the DVD/video submissions this year. For
the first time, submission was possible in many different formats,
including PowerPoint with a sound track. There were 12 submissions and
9 of these were accepted. Erik learned a lot during the process and
has several suggestions for how to reduce the effort in future years;
his experiences and suggestions will be communicated to the next
DVD/video chair (Remco Veltkamp). A hearty thanks goes to the MIT
video guru Tom Buehler, without whom the DVD production would not have
been possible.
The DVD contributions will become available on compgeom.org, kindly
offered by Herve Bronnimann. Temporarily, they are available at
http://theory.lcs.mit.edu/~edemaine/SoCG2003_multimedia/webproceedings/.
Jack Snoeyink mentioned that we also have a poster session from
FCRC, with interesting computational geometry related topics.
4. John Iacono announced that SoCG'04 will take place on June 9-11,
2004, at Brooklyn Polytechnic (New York). The new dorms will be
available as the primary accommodation; a single room will cost
approximately $60/night, and a double will be approximately $40/night
per person. Each suite of 2 rooms has one shared bathroom.
Participants may also choose to stay at any hotel facilities in the
City, but there will be no blocks of reserved hotel rooms.
5. Jack Snoeyink spoke on behalf of Jean-Daniel Boissonnat and himself
as co-chairs of the PC of SoCG'04. The PC will be announced shortly.
Jack pointed out that the conflict with Solid Modeling'2004, which
takes place in Italy during the same dates as SoCG'04, causes some
difficulty in recruiting PC members from some of the applied
areas. Jack suggested that conflicts with Solid Modeling be avoided in
the future; Joe Mitchell indicated that the steering committees for
SoCG and for Solid Modeling are in communication to discuss the issue
of avoiding conflicts and possibly co-locating the two conferences in
some future year.
6. Three locations were candidate for SoCG'05. Jurek Jaromczyk
presented a bid for locating in Cracow, at Jagiellonian University.
Marco Pellegrini presented a bid for locating in Pisa, Italy, on the
CNR campus. Tetsuo Asano made a bid for hosting the conference at
JAIST in Japan. All three bids were well received and found to be
quite attractive. (Guenter Rote even suggested that we should be able
to vote up to three times instead of once.)
The vote turned out in favor of Pisa (36 votes), with Cracow receiving
22 votes and Japan receiving 12 votes. In Pisa, the conference will
be held at the CNR campus. The co-organizer is Giuseppe Liotta. Dates
will probably be June 6-8, 2005. Accommodations will be downtown, in
various hotels, where single rooms are roughly 82 Euros and doubles
are roughly 92 Euros, for 3-star hotels.
7. Jeff Erickson announced that is in the process of writing a new
latex style file to be used in the future for the SoCG proceedings.
This won a round of applause. He asked the community for constructive
and clearly stated suggestions.
8. Joe Mitchell called for a straw vote to see if the proceedings
should contain color pages. A group of 1-8 pages will add
approximately $500 to the total conference budget, while a group of
9-16 pages will add about $1000. The pages will need to be
consecutive, e.g., in the middle or at the end of the proceedings.
The program committee would have authority to assign color page
resources to individual papers. The straw vote showed about 18 people
in favor of this option.
At 19.30 Joe closed the business meeting.
-------------
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 brd at snow.cs.dartmouth.edu Fri Jun 20 14:38:29 2003
From: brd at snow.cs.dartmouth.edu (Bruce Randall Donald)
Date: Mon Jan 9 13:41:11 2006
Subject: Postdoc Positions in Computational Biology
Message-ID: <200306201338.NAA37231@snow.cs.dartmouth.edu>
DARTMOUTH
POSTDOCTORAL POSITIONS IN STRUCTURAL GENOMICS
COMPUTATIONAL GEOMETERS
COMPUTER SCIENTISTS
NMR SPECTROSCOPISTS
We are funded by the National Institutes of Health under the auspices
of the National Institute of General Medical Sciences Protein
Structure Initiative (http://www.nih.gov/nigms/funding/psi.html) to
develop novel computational methods to enable high-throughput
structural and functional studies of proteins. A key focus is
structural genomics, whose goal is (in the broadest terms) to
determine the three-dimensional structures of all proteins in nature,
through a combination of direct experiments and theoretical
analysis. Proteins are the worker molecules in every living thing. By
determining the structures of proteins, we are better able to
understand how each protein functions normally and how faulty protein
structures can cause disease. Scientists can use the structures of
disease-related proteins to help develop new medicines and diagnostic
techniques.
For a description of our research and papers, please visit:
http://www.cs.dartmouth.edu/~brd/Research/Bio/
Computer scientists, computational geometers, and NMR spectroscopists
are encouraged to apply for postdoctoral research positions in our
lab. Applicants with a Ph.D. or equivalent experience should submit a
C.V. and a brief statement of research accomplishments and interests
(not to exceed two pages), and arrange for three letters of
recommendation to be sent directly to the Principal Investigator,
Professor Bruce R. Donald
6211 Sudikoff Laboratory
Department of Computer Science
Dartmouth
Hanover, NH 03755-3510
email: brd@cs.dartmouth.edu
Dartmouth has proved an excellent environment for research in
Computational Biology and Chemistry, and we have a distinguished
record of job placement for Donald Lab alumni. For more information
on our laboratory, and details of the application process, please
visit:
http://www.cs.dartmouth.edu/~brd/Jobs/
-------------
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 marc at cs.uu.nl Tue Jun 24 18:36:57 2003
From: marc at cs.uu.nl (Marc van Kreveld)
Date: Mon Jan 9 13:41:11 2006
Subject: Steering committee term ends; call for nominations
Message-ID: <3EF87019.3000204@cs.uu.nl>
Dear CG Community,
You may recall that the Computational Geometry Steering
Committee was elected in August of 2001 for a term of two years.
It is therefore time to elect a new committee. As the secretary
of the Steering Committee I write you now to call for nominations.
The current committee is:
Nina Amenta
Jeff Erickson
Dan Halperin
Marc van Kreveld (secretary)
Joe Mitchell (chair)
The committee organizes the annual SoCG (Symposium on Computational
Geometry), conducts its business meeting, serves as liaisons to other
organizations (e.g., FCRC), and so on.
I will conduct the election in the same manner as before.
Any member of the community may nominate any other member by sending
e-mail directly to me by the deadline (see below). Nominations of
past committee members are allowed. It is not necessary to
check with those whom you nominate.
After nominations have been received, I will contact those
nominated and ask them if they are willing to serve. A list of
candidates will then be prepared and circulated via compgeom-announce.
The community will be asked to vote for five from the list. The five
with the most votes will then become the new Steering Committee.
It will be up to them to select a Chair and otherwise organize
themselves. The new Steering Committee will serve for three years.
To nominate someone, send email to
marc@cs.uu.nl
with Subject: "Nomination" before Thursday July 31, 2003. We look
forward to hearing from you!
Marc van Kreveld
-------------
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 emo at inf.ethz.ch Mon Jun 23 16:07:17 2003
From: emo at inf.ethz.ch (emo@inf.ethz.ch)
Date: Mon Jan 9 13:41:11 2006
Subject: MSRI workshop: Math. Foundation of Geometric Algorithms
Message-ID: <200306231307.PAA14922@blabla.inf.ethz.ch>
WORKSHOP ON THE MATHEMATICAL FOUNDATION OF GEOMETRIC ALGORITHMS
---------------------------------------------------------------
Mathematical Sciences Research Institute, Berkeley
--------------------------------------------------
October 13-17, 2003
-------------------
As you may already know, the Mathematical Sciences Research Institute in
Berkeley is organizing a half-year program on Discrete and Computational
Geometry for the Fall of 2003. The program will extend from August 11 to
December 19, and will include several workshops, a weekly research
colloquium, and a postdoc seminar, with the participation of a number of
senior long-term visitors as well as many visitors for shorter periods.
One of the major activities of the semester will be a workshop on
the Mathematical Foundation of Geometric Algorithms, which is
scheduled to take place from Monday, October 13, through Friday,
October 17, 2003. It features invited and contributed talks. The
invited speakers include
Pankaj Agarwal (Duke)
Nina Amenta (Davis)
Timothy Chan (Waterloo)
Bernard Chazelle (Princeton)
Otfried Cheong (Eindhoven)
Herbert Edelsbrunner (Duke)
Bernd Gaertner (ETH Zurich)
Leo Guibas (Stanford)
Dan Halperin (Tel Aviv)
Sariel Har-Peled (Urbana-Champaign)
Patrice Koehl (Stanford)
Vladlen Koltun (Berkeley)
Joe Mitchell (Stony Brook)
David Mount (Maryland)
Marie-Francoise Roy (Rennes)
Jonathan Schewchuk (Berkeley)
Shakhar Smorodinsky (Berkeley)
Jack Snoeyink (North Carolina)
Subhash Suri (Santa Barbara)
Kasturi Varadarajan (Iowa)
Santosh Vempala (MIT)
Uli Wagner (Berkeley)
For more information about the semester program and the workshop,
please go to the MSRI Web site (http://www.msri.org) and click
on Programs / Workshops.
People that are interested in attending the workshop should register
for it (via the MSRI site) as soon as possible, especially if they are
seeking financial assistance (of which some limited amount will be
awarded).
Workshop Organizing Committee:
Pankaj Agarwal
Herbert Edelsbrunner
Micha Sharir
Emo Welzl
-------------
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.