From rene at ads.tuwien.ac.at Thu Feb 1 11:19:17 2001
From: rene at ads.tuwien.ac.at (=?iso-8859-1?Q?Ren=E9_Weiskircher?=)
Date: Mon Jan 9 13:40:59 2006
Subject: Graph Drawing 2001 Vienna
Message-ID:
***********************************************************************
***** Call for Papers *****
****** ******
******** G R A P H D R A W I N G 2 0 0 1 ********
******** ********
******** September 23-26, 2001, Vienna, Austria ********
****** ******
***** http://www.ads.tuwien.ac.at/gd2001 *****
***********************************************************************
*** Scope: ***
Theory - Algorithms - Software. The symposium is a forum for
researchers, practitioners, developers, and users working on all
aspects of graph visualization and representation. The range of
issues considered in graph drawing includes graph algorithms,
graph theory, computational geometry, topology, planarity issues,
combinatorics, optimization, heuristics, local search, computational
cartography, information visualization, visual languages, visual
perception, computer-human interaction, applications, and practical
systems.
Graph drawing is becoming increasingly important in many applications
including visualization tasks in software engineering (e.g., automatic
layout of UML-diagrams), business process modeling (e.g., organization
diagrams, event-driven process chains), and computational biology
(e.g., display of biochemical pathways). Researchers and practitioners
with an interest in these or other applications are especially welcome
to participate.
*** Software_Exhibition: ***
During the conference there will be a graph drawing software
exhibition for which we hope to attract all state-of-the-art software
tools in graph drawing. The software will be accessible for all
conference participants on computers in the hall of the conference
building.
*** Graph_Drawing_Contest: ***
See the GD 2001 web site.
*** Location: ***
The conference will take place in the building of the Austrian Academy
of Sciences (picture on the 100 schilling bank note) which is located
in the center of Vienna at Dr. Ignaz Seipel Platz 2 (about 3 minutes
walking distance from Stephansdom).
*** Satellite Event: Bike Tour to Vienna ***
Go to Vienna by bike! There is a scenic bike route from Passau - the
site of GD 95 - to Vienna. The tour is about 300 km long and follows
the Danube river on the historic Nibelungen trail. It's an easy ride,
completely on bike paths and down hill.
As an introduction to the bike tour, an informal workshop on "Drawing
Large Graphs" shall be held at the University of Passau on Wednesday,
September 19, 2001. The bike tour and the workshop are organized by
Franz Brandenburg.
*** Call_for_Papers_and_Software: ***
* PAPERS: We invite papers describing original research of
theoretical or practical significance to graph drawing.
A submission consists of a standard PostScript or PDF file of
an extended abstract or full draft paper of at most 15 pages
in Springer LNCS-style format, including fax number and e-mail
address.
* SOFTWARE: A contribution to the software exhibition consists
of the software in executable format for Windows, Linux, or
Solaris, a poster, and a 2 page short description in Springer
LNCS-style format, including fax number and e-mail address.
Please e-mail submissions to gd2001@ads.tuwien.ac.at by May 28, 2001.
See http://www.springer.de/comp/lncs/authors.html for Springer
LNCS-style format requirements.
*** Proceedings: ***
Accepted papers (at most 15 pages) and software (2 pages) will be
published in the conference proceedings, which will appear in the
series Lecture Notes in Computer Science of Springer-Verlag. The
camera-ready copy as well as electronic files of accepted papers and
software are due at the conference. A selection of the exhibited
software will be invited to contribute to a book on state-of-the-art
graph drawing software. This book will be one of the first volumes
in a new book series called "Mathematics and Visualization" that will
be launched by Springer-Verlag.
*** Program Committee: ***
Petra Mutzel, Vienna University of Technology - chair
Michael Juenger, University of Cologne - co-chair
Franz Aurenhammer, Graz University of Technology
Therese Biedl, University of Waterloo
Giuseppe Di Battista, University of Rome III
Franz Brandenburg, University of Passau
Yefim Dinitz, Ben Gurion University
Peter Eades, University of Sydney
Herbert Fleischner, Austrian Academy of Sciences
Hubert de Fraysseix, CNRS Paris
Mike Goodrich, Johns Hopkins University
Jan Kratochvil, Charles University Prague
Giuseppe Liotta, University of Perugia
Brendan Madden, Tom Sawyer Software
Shin-ichi Nakano, Gunma University
*** Organizing Committee: ***
Petra Mutzel, Vienna University of Technology - chair
Michael Juenger, University of Cologne - co-chair
Leonid Dimitrov, Austrian Academy of Sciences
Barbara Hufnagel, Vienna University Of Technology
Gunnar Klau, Vienna University of Technology
Sebastian Leipert, caesar Bonn
Rene Weiskircher, Vienna University Of Technology
Emanuel Wenger, Austrian Academy of Sciences
*** Software Exhibition Organizers: ***
Martin Gruber, Vienna University of Technology
Thomas Lange, University of Cologne
*** Graph Drawing Contest Organizer: ***
Franz Brandenburg, University of Passau
*** Important Dates:***
Submission of papers and software: May 28, 2001
Notification of acceptance: July 17, 2001
Registration: July 31, 2001
Final version due: Sept. 23, 2001
*** Contact Information: ***
Petra Mutzel - GD 2001
Institute of Computer Graphics and Algorithms
Vienna University of Technology
Favoritenstr. 9-11 E186
A-1040 Vienna, Austria
-----
fax: +43 1 58801 18699
phone: +43 1 58801 18611
e-mail: gd2001@ads.tuwien.ac.at
**** Graph Drawing 2001 Web Site: ****
http://www.ads.tuwien.ac.at/gd2001
***********************************************************************
**** GD 2001 is organized by Vienna University of Technology, *****
**** Austrian Academy of Sciences, and University of Cologne *****
***********************************************************************
-------------
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 hodges at cs.duke.edu Tue Feb 6 10:47:22 2001
From: hodges at cs.duke.edu (Celeste Hodges)
Date: Mon Jan 9 13:40:59 2006
Subject: Position Announcement - Duke University
Message-ID: <3A801C8A.1CE65DAE@cs.duke.edu>
VISITING ASSISTANT PROFESSOR
POSITION AVAILABLE
Center for Geometric and Biological Computing
Department of Computer Science
Duke University
A postdoctoral position at the level of Visiting Assistant Professor
is available in the Center for Geometric and Biological Computing,
Department of Computer Science at Duke University, for the NSF-ITR
Bio-Geometry project funded by the National Science Foundation, under
the supervision of Profs. Pankaj Agarwal, Herbert Edelsbrunner, and
Homme Hellinga. Duke is an equal opportunity employer. The position,
which is contingent upon grant funding, is for one year and can be
extended to one or more additional years by mutual consent.
The project, a collaborative effort with UNC, Stanford, and NC A&T,
aims to develop new computational techniques and paradigms for
representing, storing, searching, simulating, analyzing, and
visualizing biological structures. Applicants must have clearly
demonstrated experience and skills in at least one and familiarity
with some of the following areas: algorithms, computational geometry,
computational topology, computational biology, molecular modeling,
structural biology. Teaching responsibilities include one research
course per year on a related topic.
Apart from pursuing his or her own research interests, the candidate
is expected to play a vital role in the center and to interact closely
with the PIs on the project from the three other sites. Additional
responsibilities include helping prepare contracts and reports.
Please send your CV and a letter of research interests, and ask three
evaluators to send letters of reference, by US Mail or email to
Ms. Celeste Hodges
Department of Computer Science
Duke University
Box 90129
Durham, NC 27708-0129
Email: hodges@cs.duke.edu
Tel: (919) 660-6511
To be assured of full consideration, all material including
reference letters must arrive by March 16, 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 amenta at cs.utexas.edu Wed Feb 7 15:46:54 2001
From: amenta at cs.utexas.edu (Nina Amenta)
Date: Mon Jan 9 13:40:59 2006
Subject: Brazilian computer graphics conference
Message-ID: <200102072146.PAA23780@corn.cs.utexas.edu>
This would be a fun opportunity to meet international computer graphics
people and our Brazilian computational geometry colleagues.
Nina
*********************************************************************
Call for Contributions
SIBGRAPI 2001
14th Brazilian Symposium on Computer Graphics and Image Processing
15-18 October 2001
Florian=F3polis (http://www.hipernet.ufsc.br/floripa/ingles/indice.htm)
Santa Catarina, Brazil
SUBMISSION DEADLINES
Full Papers: May 04, 2001 Tutorial Proposals: May 25, 2001
Panel Proposals: Jul 01, 2001 Technical Posters: Jul 04, 2001
Cover Image: Jul 15, 2001 Videos: Jul 20, 2001
http://www.dca.fee.unicamp.br/~sib2001/
SIBGRAPI is a traditional (annual) and main scientific event of
Brazilian Computer Graphics and Image Processing community, sponsored
by the Brazilian Computer Society (http://www.sbc.org.br). The
symposium is intended to bring the Remote Sensing, Image Processing,
Vision, Graphics,
Computational Geometry, and Geometric Modeling communities together.
SIBGRAPI 2001 will be held in conjunction with Brazilian Symposium on
Multimidia and Hypermidia (SBMIDIA), Workshop on Human Factors in
Computer Systems (IHC) and Symposium on Virtual Reality (SVR). Its
technical program consists of invited talks, tutorials, video
exhibition, and panel sessions with topics of general interest. All
information on past SIBGRAPI events can be found at
http://www.sbc.org.br/cegrapi/.
You are cordially invited to participate by submitting your work in
the areas of Computer Graphics and Image Processing, including but not
limited to the following:
+ Image synthesis,
+ Geometric modeling,
+ Graphical interfaces,
+ Multimedia,
+ Image segmentation,
+ Computer vision,
+ Image compression,
+ Remote sensing,
+ Graphics hardware,
+ Animation and simulation,
+ Computational geometry,
+ Scientific visualization,
+ Image retrieval,
+ Pattern recognition,
+ Mathematical morphology,
+ Three-dimensional images,
+ Geographical databases,
+ Applications.
Full instructions for submissions are available at
http://www.dca.fee.unicamp.br/~sib2001/.
Contributions should be in one of the following categories:
+ FULL PAPERS, presented as technical lectures and published in the
Proceedings as two-column, 8-page papers.
+ TECHNICAL POSTERS, presented in a special session and published in
the Proceedings as two-column, 1-page papers.
+ PANELS on topics related to the SIBGRAPI 2001 themes and their
short descriptions published in the Proceedings as
two-column, 2-page papers.
+ TUTORIALS about classical or timely topics, ranged from elementary
to advanced, consisting of three to six hours of
lectures with printed notes (20-50 pages).
+ FRONT COVER IMAGES generated by computer graphics or image
processing techniques, to be printed on the front cover of the
SIBGRAPI 2001 proceedings.
+ VIDEOS generated by computer graphics or digital video processing
techniques to be presented in a special session.
Papers, posters, and contributions to panels are to be submitted in
English,
while tutorial proposals may be either in English or in Portuguese.
In case of questions please feel free to contact the Program Co-Chairs:
Wu, Shin - Ting (Unicamp)
ting@dca.fee.unicamp.br
Dibio Leandro Borges (PUC-PR)
dibio@ppgia.pucpr.br
IMPORTANT DATES:
*Full Papers
Submission: May/04/2001
Notification of acceptance: Jul/02/2001
Camera-Ready: Jul/31/2001
*Technical Posters
Submission: Jul/04/2001
Notification of acceptance: Jul/20/2001
Camera-Ready: Jul/31/2001
*Panel Contributions
Submission: Jun/01/2001
Notification of acceptance: Jul/20/2001
Camera-Ready: Jul/31/2001
*Tutorial Proposals
Submission: May/25/2001
Notification of acceptance: Jul/02/2001
Camera-Ready: Jul/31/2001
*Cover Images
Submission: Jul/15/2001
Notification of acceptance: Jul/20/2001
*Videos
Submission: Jul/20/2001
Notification of acceptance: Sep/21/2001
Exhibition and award cerimony: Oct/17/2001
SIBGRAPI 2001 COMMITTEE:
Organization Committee
Fernando Ostuni Gauthier (UFSC, Brazil)
Raul S. Wazlawick (UFSC, Brazil)
Roberto Willwrich (UFSC, Brazil)
Walter de Abreu Cybis (UFSC, Brazil)
Program Committee Co-Chairs:
Dibio Leandro Borges (UFG, Brazil)
dibio@lis.eee.ufg.br
Wu, Shin - Ting (Unicamp, Brazil)
ting@dca.fee.unicamp.br
Tutorial Co-Chairs:
Luiz Henrique de Figueiredo (IMPA, Brazil)
lhf@visgraf.impa.br
Luiz Marcos Garcia Gon=E7alves (UFRJ, Brazil)
lmarcos@lcg.ufrj.br
Video Festival Coordinator:
Jos=E9 Mario De Martino (Unicamp, Brazil)
martino@dca.fee.unicamp.br
International Technical Committee
Adnan Amin (UNSW, Australia)
Alejandro C. Frery (UFPe, Brazil)
Alexander A. Pasko(Hosei University, Japan)
Antonio Elias Fabris (USP-IME, Brazil)
Antonio Nuno de Castro Santa Rosa (UnB, Brazil)
Arnaldo de Albuquerque Ara=FAjo (UFMG, Brazil)
Aura Conci (UFF, Brazil)
Creto Augusto Vidal (UFC, Brazil)
Daniel Thalmann (LIG-EPFL, Switzerland)
Edward M. Riseman (UMASS, USA)
Flavio Bortolozzi (PUC-PR, Brazil)
Hans-Peter Seidel (Max-Planck-Institute, Germany)
Joaquim A. Jorge (IST-UTL, Portugal)
Joao Marques de Carvalho (UFPb, Brazil)
Jose Luis Encarna=E7=E3o (FhG-IGD, Germany)
Gabriel Taubin (IBM T.J. Watson, USA)
Marcelo K. Zuffo (USP-POLI, Brazil)
Marcelo Dreux (PUC-RIO, Brazil)
Maria Andreia Formico Rodrigues (UFC, Brazil)
Michel Couprie (ESIEE, France)
Myoung-hee Kim (Ewha Womans University, Korea)
Nelson D. A. Mascarenhas (UFSCar, Brazil)
Neucimar Jeronimo Leite (Unicamp, Brazil)
Nina Amenta (U.T. Austin, USA)
Oscar H. Bustos (UNCor, Argentina)
Paulo Cezar Pinto Carvalho (IMPA, Brazil)
Patricia Lobo Netto (Vetor Zero, Brazil)
Pedro J. de Rezende (Unicamp, Brazil)
Robert Sabourin (University of Quebec, Canada)
Roseli de Deus Lopes (USP-POLI, Brazil)
Sameer Singh (University of Exeter, United Kingdom)
Silvia Delgado Olabarriaga (UFRGS, Brazil)
Soraia Raupp Musse (UNISINOS, Brazil)
Vaclav Skala (University of West Bohemia, Czech Republic)
-------------
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 yjc at photon.poly.edu Wed Feb 7 11:46:19 2001
From: yjc at photon.poly.edu (Yi-Jen Chiang)
Date: Mon Jan 9 13:40:59 2006
Subject: WADS 2001 Final Call for Papers
Message-ID:
WADS 2001 Final Call for Papers: This is a reminder that the paper
submission deadline is February 19.
---------------
CALL FOR PAPERS
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
The Workshop on Algorithms and Data Structures, which alternates with
the Scandinavian Workshop on Algorithm Theory, is intended as a forum
for researchers in the area of design, analysis, and implementation of
algorithms and data structures. We invite submissions of papers
presenting original research on the theory and applications of
algorithms and data structures in all areas, including combinatorics,
computational biology, computational geometry, databases, graph
drawing, graphics, information retrieval, information security,
parallel and distributed computing.
Contributors are invited to submit an extended abstract not exceeding
12 pages by February 19, 2001. Detailed submission instructions are
posted at http://www.wads.org/. The proceedings will be published in
the Springer-Verlag series Lecture Notes in Computer Science.
Deadlines:
February 19: submission of papers
April 18: notification of acceptance/rejection of papers
May 9: submission of accepted papers in camera-ready form
June 20: advance registration
Invited Speakers:
M. J. Atallah (Purdue)
F. T. Leighton (Akamai Technologies and MIT)
M. Yannakakis (Bell Laboratories)
Conference Organization:
Conference Chair: R. Tamassia (Brown)
Publicity Chair: Y.-J. Chiang (Polytechnic)
Local Arrangements Chair: G. Shubina (Brown)
Program Committee:
Co-Chairs:
F. Dehne (Carleton), J.-R. Sack (Carleton), R. Tamassia (Brown)
PC-Members:
A. Apostolico, T. Chan, B. Codenotti, G. Di Battista, S. Dolev,
M. Farach-Colton, P. Fraigniaud, H. Gabow, S. Goldman, G. Gonnet,
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
-------------
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 Michael.Aupetit at site-eerie.ema.fr Thu Feb 8 10:32:36 2001
From: Michael.Aupetit at site-eerie.ema.fr (aupetit)
Date: Mon Jan 9 13:40:59 2006
Subject: convexity for discrete set of points...
Message-ID: <3A8267B4.D8B862EE@site-eerie.ema.fr>
Hello,
I'm a PhD student from France. I'd like to know if it exists a
"correct" name for the following property:
considering a set S of a finite number N of points in R^d and
an indicator value 0 or 1 associated to them which indicates
if the points are part or not of a particular set X. (X subset of S)
If any point of X is inside the convex hull of X,
then I would like to say that X is "convex".
And if it exists at least one point in S which is not in X but
which is in the convex hull of X, I would like to say that
X is not "convex".
I'm not sure I can use the term "convex" for that property.
Does it already exist a well suited term for that?
Thank you for your help
Michael Aupetit
0 0 0 0 0 0 0 0 0 0
0 1 1 1 0 0 1 1 1 0
0 1 1 1 0 0 1 0 1 0
0 1 1 1 0 0 1 1 1 0
0 0 0 0 0 0 0 0 0 0
"convex" - "non convex" ?
-------------
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 george at cs.ucy.ac.cy Thu Feb 8 13:04:28 2001
From: george at cs.ucy.ac.cy (George Angelos Papadopoulos)
Date: Mon Jan 9 13:40:59 2006
Subject: Academic Vacancies -- CS Dept., Univ. of Cyprus
Message-ID:
DEPARTMENT OF COMPUTER SCIENCE
UNIVERSITY OF CYPRUS
VISITING PROFESSORSHIPS
The Department of Computer Science at the University of Cyprus has a
number of vacancies for visiting professors at the ranks of Assistant,
Associate, and Full Professor. ALL fields of study will be considered,
but preference will be given to applicants associated with one or more
of the following ones:
* Computer Architecture * Parallel and Distributed Processing
* Programming Languages * Multimedia Information Systems
* Data Communication Networks * Artificial Intelligence
* Software Engineering * Database Systems
A new M.Sc. course on "Advanced Information Technologies" is now
offered by the Department and the successful applicants will therefore
have the opportunity to teach at both the undergraduate and graduate
levels.
A visiting appointment is usually for one semester (Spring semester:
Jan-June; Winter semester: Sept-Dec), but it can be renewed for up to
four semesters.
Applicants should hold a Ph.D. in a relevant subject, have post
Ph.D. experience, and BE FLUENT IN GREEK (both these requirements are
mandatory).
The annual salaries for these positions (including the 13th salary)
are:
Professor (Scale A15-A16) CYP 27,875 - 36,235
Associate Professor (Scale A14-A15) CYP 24,587 - 33,518
Assistant Professor (Scale A13-A14) CYP 22,938 - 30,940
Lecturer (Scale A12-A13) CYP 17,706 - 28,372
(At present CYP 1 = 1.1 sterling and CYP 1 = 1.6 U.S. dollars).
Presently, the Department is seeking applications for the winter and
spring semesters of the academic year 2001-2002. The processing of
applications will start on the 1st May 2001 and will continue until
all the available positions have been filled. Anyone wishing to apply
should send a full CV to the following address:
The Chairperson
Department of Computer Science
University of Cyprus
75 Kallipoleos Street
P.O. Box 20537, CY-1678
Nicosia, CYPRUS
For more details and other information, interested individuals may
contact the Chairperson of the Department of Computer Science:
Associate Professor Antonis Kakas
Tel: +357-2-892230/1, Fax: +357-2-339062, E-mail: antonis@ucy.ac.cy
-------------
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 yjc at photon.poly.edu Wed Feb 7 11:46:19 2001
From: yjc at photon.poly.edu (Yi-Jen Chiang)
Date: Mon Jan 9 13:40:59 2006
Subject: [DMANET] WADS 2001 Final Call for Papers
Message-ID:
WADS 2001 Final Call for Papers: This is a reminder that the paper
submission deadline is February 19.
---------------
CALL FOR PAPERS
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
The Workshop on Algorithms and Data Structures, which alternates with
the Scandinavian Workshop on Algorithm Theory, is intended as a forum
for researchers in the area of design, analysis, and implementation of
algorithms and data structures. We invite submissions of papers
presenting original research on the theory and applications of
algorithms and data structures in all areas, including combinatorics,
computational biology, computational geometry, databases, graph
drawing, graphics, information retrieval, information security,
parallel and distributed computing.
Contributors are invited to submit an extended abstract not exceeding
12 pages by February 19, 2001. Detailed submission instructions are
posted at http://www.wads.org/. The proceedings will be published in
the Springer-Verlag series Lecture Notes in Computer Science.
Deadlines:
February 19: submission of papers
April 18: notification of acceptance/rejection of papers
May 9: submission of accepted papers in camera-ready form
June 20: advance registration
Invited Speakers:
M. J. Atallah (Purdue)
F. T. Leighton (Akamai Technologies and MIT)
M. Yannakakis (Bell Laboratories)
Conference Organization:
Conference Chair: R. Tamassia (Brown)
Publicity Chair: Y.-J. Chiang (Polytechnic)
Local Arrangements Chair: G. Shubina (Brown)
**********************************************************
*
* 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 chazelle at CS.Princeton.EDU Thu Feb 8 19:38:33 2001
From: chazelle at CS.Princeton.EDU (Bernard Chazelle)
Date: Mon Jan 9 13:40:59 2006
Subject: New Book
Message-ID: <3A833C09.672AC04C@cs.princeton.edu>
New Book:
Spice up the long winter months
with this thriller by your bedside!
THE DISCREPANCY METHOD: RANDOMNESS AND COMPLEXITY
Bernard Chazelle, Cambridge University Press, ISBN: 0521770939
Check out: http://www.cs.princeton.edu/~chazelle/book
for the table of contents and how to order.
Go to: http://www.cs.princeton.edu/~chazelle/
to see what the book will look like
on your bedside table.
-------------
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 aronov at ziggy.poly.edu Sat Feb 10 08:37:37 2001
From: aronov at ziggy.poly.edu (Boris Aronov)
Date: Mon Jan 9 13:40:59 2006
Subject: Goodman-Pollack Fest postponed
Message-ID: <200102101337.IAA15405@ziggy.poly.edu>
New York University
Courant Institute of Mathematical Sciences
THE GOODMAN--POLLACK TWO-THIRDS-OF-A-CENTURY FEST
We regret to announce the postponement of the Goodman-Pollack
Two-thirds-of-a-century Fest that was scheduled for next Friday,
February 16. The postponement is due to an illness of Ricky Pollack.
In spite of his good recovery, we feel that it is safer to postpone
the event.
We will notify you once the event is re-scheduled. We hope to
schedule it soon for some time during this semester.
With best regards,
Janos Pach and Micha Sharir
-------------
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 Thu Feb 15 11:39:09 2001
From: eppstein at ics.uci.edu (David Eppstein)
Date: Mon Jan 9 13:40:59 2006
Subject: SoCG 2001 accepted papers
Message-ID: <40951261.3191225949@hyperbolic.ics.uci.edu>
The following papers have been accepted to the 17th ACM Symposium on
Computational Geometry, to be held June 3-5, 2001, at Tufts University,
Medford, MA. For more information about the conference, see its web page,
. This list includes papers from
both the theory and applied tracks, but does not include the video
program, which is not scheduled to be announced until March 1.
Box-Trees and R-Trees with Near-Optimal Query Time,
Pankaj K. Agarwal and Mark de Berg and Joachim Gudmundsson and Mikael
Hammar and Herman J. Havekort
On the Number of Congruent Simplices in a Point Set,
Pankaj K. Agarwal and Micha Sharir
Enumerating Order Types for Small Point Sets with Applications,
O. Aichholzer and F. Aurenhammer and H. Krasser
Exact $L_\infty$ Nearest Neighbor Search in High Dimensions,
Helmut Alt and Laura Heinrich-Litan
A Sum of Squares Theorem for Visibility Complexes,
Pierre Angelier and Michel Pocchiola
New Bounds on the Betti Numbers of Semi-Algebraic Sets and Arrangements of
Real Algebraic Hypersurfaces,
Saugata Basu
Farthest Neighbors and Center Points in the Presence of Rectangular
Obstacles,
Boaz Ben-Moshe and Matthew J. Katz and Joseph S. B. Mitchell
A Segment-Tree Based Kinetic BSP,
Mark de Berg and Joao Comba and Leonidas J. Guibas
Schematization of Road Networks,
Sergio Cabello and Mark de Berg and Steven van Dijk and Marc van Kreveld
and Tycho Strijk
A Fully Dynamic Algorithm for Planar Width,
Timothy M. Chan
Algorithms for Congruent Sphere Packing and Applications,
Danny Z. Chen and Xiaobo (Sharon) Hu and Yingping Huang and Yifan Li
and Jinhui Xu
Walking in a Triangulation,
Olivier Devillers and Sylvain Pion and Monique Teillaud
Detecting Undersampling in Surface Reconstruction,
Tamal K. Dey and Joachim Giesen
Efficient and Small Representation of Line Arrangements with
Applications,
David P. Dobkin and Ayellet Tal
Binary Space Partitions for Axis-Parallel Segments, Rectangles, and
Hyperrectangles,
Adrian Dumitrescu and Joseph S. B. Mitchell and Micha Sharir
Sink-insertion for Mesh Improvement,
Herbert Edelsbrunner and Damrong Guoy
Hierarchical Morse Complexes for Piecewise Linear 2-Manifolds,
Herbert Edelsbrunner and John Harer and Afra Zomorodian
Nice Point Sets Can Have Nasty Delaunay Triangulations,
Jeff Erickson
Simplifying a Polygonal Subdivision While Keeping it Simple,
Regina Estkowski and Joseph S. B. Mitchell
Discrete Mobile Centers,
Jie Gao and Leonidas J. Guibas and John Hershberger and Li Zhang and An Zhu
polymake: an Approach to Modular Software Design in Computational
Geometry,
Ewgenij Gawrilow and Michael Joswig
Computing the Intersection of Quadrics: Exactly and Actually!,
Nicola Geismann and Michael Hemmer and Elmar Schoemer
A Randomized Art-Gallery Algorithm for Sensor Placement,
Hector Gonzalez-Banos and Jean-Claude Latombe
A Practical Approach for Computing the Diameter of a Point-Set,
Sariel Har-Peled
Notes on Computing Peaks in k-Levels and Parametric Spanning Trees,
Naoki Katoh and Takeshi Tokuyama
Geometric Permutations of Fat Objects,
Matthew Katz and Kasturi Varadarajan
Intersection Searching Problems in General Settings,
Vladlen Koltun
PRECISE: Efficient Multiprecision Evaluation of Algebraic Roots and
Predicates for Reliable Geometric Computation,
S. Krishnan and M. Foskey and T. Culver and J. Keyser and D. Manocha
On the Complexity of Halfspace Area Queries,
Stefan Langerman
Computing a Canonical Polygonal Schema of an Orientable
Triangulated Surface,
Francis Lazarus and Michel Pocchiola and Gert Vegter and Anne Verroust
Hardware-Assisted View-Dependent Map Simplification,
Nabil Mustafa and Eleftheris Koutsofios and Shankar Krishnan and
Suresh Venkatasubraminian
The Union of Congruent Cubes in Three Dimensions,
Janos Pach and Ido Safruti and Micha Sharir
Efficient Perspective-Accurate Silhouette Computation and
Applications,
Mihai Pop and Gill Barequet and Christian A. Duncan and
Michael T. Goodrich and Wenjing Huang and Subodh Kumar
Monotone Paths in Line Arrangements,
Rados Radoicic and Geza Toth
Area-Preserving Piecewise-Affine Transformations,
Alan Saalfeld
The Clarkson-Shor Technique Revisited and Extended,
Micha Sharir
Balanced Lines, Halving Triangles, and the Generalized Lower Bound Theorem,
Micha Sharir and Emo Welzl
Different Distances of Planar Point Sets,
Jozsef Solymosi and Csaba David Toth
A Note on Binary Plane Partitions,
Csaba David Toth
--
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 am7a021 at math.uni-hamburg.de Mon Feb 19 14:49:33 2001
From: am7a021 at math.uni-hamburg.de (Longin Jan Latecki)
Date: Mon Jan 9 13:40:59 2006
Subject: convexity for discrete set of points...
Message-ID:
Hi,
The term Michael Aupetit defines is called digital convexity.
There are a few definitions of digital convexity,
which are not necessarily equivalent.
I can recommend two older references:
Rosenfeld, A., Kim, C.E.,
How a Digital Computer Can Tell Whether a Line is Straight,
AMM(89), 1982, pp. 230-235.
Kim, C.E., and Rosenfeld, A.,
Digital Straight Lines and Convexity of Digital Regions,
PAMI(4), No. 2, March 1982, pp. 149-153.
With best regards,
Longin Jan
***
Dr. Longin Jan Latecki
Department of Applied Mathematics
University of Hamburg
Bundesstr. 55, 20146 Hamburg, Germany
Email: latecki@math.uni-hamburg.de
http://www.math.uni-hamburg.de/home/latecki/
Phone: ++49 40 428385156 or ++49 40 822273241
Fax: ++49 40 42838 5117
Michael Aupetit wrote:
To: "compgeom-discuss@research.bell-labs.com"
, aupetit@eerie.site-eerie.ema.fr
Subject: convexity for discrete set of points...
From: aupetit
Date: Thu, 08 Feb 2001 10:32:36 +0100
Hello,
I'm a PhD student from France. I'd like to know if it exists a
"correct" name for the following property:
considering a set S of a finite number N of points in R^d and
an indicator value 0 or 1 associated to them which indicates
if the points are part or not of a particular set X. (X subset of S)
If any point of X is inside the convex hull of X,
then I would like to say that X is "convex".
And if it exists at least one point in S which is not in X but
which is in the convex hull of X, I would like to say that
X is not "convex".
I'm not sure I can use the term "convex" for that property.
Does it already exist a well suited term for that?
Thank you for your help
Michael Aupetit
0 0 0 0 0 0 0 0 0 0
0 1 1 1 0 0 1 1 1 0
0 1 1 1 0 0 1 0 1 0
0 1 1 1 0 0 1 1 1 0
0 0 0 0 0 0 0 0 0 0
"convex" - "non convex" ?
-------------
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 cterlapu at cse.unl.edu Tue Feb 20 10:31:56 2001
From: cterlapu at cse.unl.edu (Chakravarthy Terlapu)
Date: Mon Jan 9 13:40:59 2006
Subject: need help
Message-ID:
Hi,
I have a image called street.tif and 2 boxes whose coordinates are for
example as follows;
//Box1
frc[i].lx = x1; //left x-coordinate
frc[i].ly = y1; //left y-coordinate
frc[i].tx = x2; //top x-coordinate
frc[i].ty = y2; //top y-coordinate
frc[i].rx = x3; //right x-coordinate
frc[i].ry = y3; //right y-coordinate
frc[i].bx = x4; //bottom x-coordinate
frc[i].by = y4; //bottom y-coordinate
//Box2
frc[i].lx = x11;
frc[i].ly = y11;
frc[i].tx = x22;
frc[i].ty = y22;
frc[i].rx = x33;
frc[i].ry = y33;
frc[i].bx = x44;
frc[i].by = y44;
I need to create a new image say street1.tif which contains
street.tif minus boxes (street.tif-boxes) i.e I have to erase all pixels
within the box1 and box2.
It would be great if anyone could help me.
THanks
Chakravarthy Terlapu
#include "tiffio.h"
#include
main()
{
int i,j,k;
unsigned short t;
int linebytes, outbytes;
uint32 w,h;
uint32 row;
unsigned char *inbuf,*outbuf;
TIFF* in;
TIFF* out;
in=TIFFOpen("street.tif","r");
out=TIFFOpen("street1.tif","w");
TIFFGetField(in, TIFFTAG_IMAGELENGTH, &h);
TIFFGetField(in, TIFFTAG_IMAGEWIDTH, &w);
TIFFSetField(out, TIFFTAG_IMAGELENGTH, h);
TIFFSetField(out, TIFFTAG_IMAGEWIDTH, w);
TIFFSetField(out, TIFFTAG_SAMPLESPERPIXEL, 1);
TIFFSetField(out, TIFFTAG_BITSPERSAMPLE, 1);
TIFFSetField(out, TIFFTAG_PHOTOMETRIC, PHOTOMETRIC_MINISBLACK);
TIFFSetField(out, TIFFTAG_ORIENTATION, 1);
linebytes=TIFFScanlineSize(in);
outbytes=TIFFScanlineSize(out);
inbuf=_TIFFmalloc(linebytes);
outbuf=_TIFFmalloc(outbytes);
for(row=0; row
-------------- next part --------------
Second Announcement: Conference on Algebraic Topological Methods
in Computer Science
Department of Mathematics
Stanford University
July 30 - August 3, 2001
The application of algebraic topological methods in areas related to
Computer Science is an emerging field that is of interest to both pure
and applied mathematical scientists. The aim of this conference is to
describe recent advances, and define the fundamental open problems in
the field through a mixture of expository and technical
lectures. There will be twenty-one main lectures, on a variety of
topics in the area.
This meeting has been funded by grants from Hewlett-Packard and the
National Science Foundation.
The following mathematical scientists have agreed to speak:
John Baez (Math, UC Riverside)
Marshall Bern (Xerox PARC)
Anders Bjorner (Royal Institute of Technology, Stockholm)
Tamal Dey (CS, Ohio State)
Herbert Edelsbrunner (CS, Duke)
David Eppstein (CS, UC Irvine)
Michael Freedman (Microsoft)
Philippe Gaucher (CNRS, Strasbourg)
Eric Goubault (Commissariat a l'Energie Atomique, France)
Jean Goubault-Larrecq (ENS Cachan)
Marco Grandis (Dip. di Mat., Genova)
Jeremy Gunawardena (HP BRIMS)
John Harer (Math, Duke)
Joel Hass (Math, UC Davis)
Maurice Herlihy (CS, Brown)
Reinhard Laubenbacher (Math, NMSU)
Laszlo Lovasz (Microsoft)
Vaughan Pratt (CS, Stanford)
Christian Reidys (Los Alamos National Lab)
Bernd Sturmfels (Math, UC Berkeley)
Noson Yanofsky (CS, Brooklyn College)
The organizers for this meeting are:
Gunnar Carlsson, gunnar@math.stanford.edu
Rick Jardine, jardine@uwo.ca
We ask that all participants register for the meeting. The latest
information and all registration forms are available at the Stanford
Conference Web Site (http://math.stanford.edu/atmcs/index.htm).
A limited amount of time at the meeting will be devoted to short talks
by conference participants. If you would like to give a short
presentation, please send an abstract to gunnar@math.stanford.edu.
There will be a volume of proceedings for the conference, to appear in
the journal "Homology, Homotopy and Applications", with Gunnar
Carlsson as senior editor. Submissions for this volume should be set
in LATEX and should be sent to gunnar@math.stanford.edu, to arrive by
Friday, August 17. We are interested in expository papers on
particular areas of application of topology, as well as research
papers.
There will be housing for conference participants on the Stanford
campus, at the rate of about 50.00 US per night for single
accomodation: a reservation form is available at the Stanford
Conference Web Site. There are also several hotels in the area - see
the Stanford site for a list.
Limited financial support may be available for travel and housing:
please make your request when registering.
From tamaldey at cis.ohio-state.edu Mon Feb 26 19:55:59 2001
From: tamaldey at cis.ohio-state.edu (tamal dey)
Date: Mon Jan 9 13:40:59 2006
Subject: Software release for surface reconstruction
Message-ID: <200102270055.TAA26718@cis.ohio-state.edu>
Dear Geometers,
It is our pleasure to announce the release of the first version
of the Cocone software that we developed at the Ohio State University
for reconstructing surfaces from their samples.
The implementation is based on CGAL and LEDA libraries and our
recent work on surface reconstruction. The details can be found at
http://www.cis.ohio-state.edu/~tamaldey/cocone.html
---Tamal K. Dey
http://www.cis.ohio-state.edu/~tamaldey
-------------
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.