From vshapiro at engr.wisc.edu Wed May 1 23:03:20 2002 From: vshapiro at engr.wisc.edu (Vadim Shapiro) Date: Mon Jan 9 13:41:06 2006 Subject: 7th ACM Symposium on Solid Modeling -- Call for Participation Message-ID: <4.2.2.20020501220301.00ac42d8@me.engr.wisc.edu> Dear Colleagues, Registration for the 7th ACM Symposium on SOLID MODELING AND APPLICATIONS http://www.mpi-sb.mpg.de/conferences/sm02/index.html is now open. The list of accepted papers and the detailed technical program can be viewed at http://www.mpi-sb.mpg.de/conferences/sm02/#program Two full days of tutorials will precede the technical program. Please join us in Saarbr?cken, Germany for what promises to be another high quality event ... and to learn more about the plans for the next symposium in 2003. Symposium Co-Chairs Program Co-chairs Hans-Peter Seidel Kunwoo Lee Vadim Shapiro Nick Patrikalakis ------------- 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 aplaza at dma.ulpgc.es Fri May 3 11:06:28 2002 From: aplaza at dma.ulpgc.es (Angel Plaza) Date: Mon Jan 9 13:41:06 2006 Subject: Is still an open problem? Message-ID: <256C7D932A2@dma.ulpgc.es> In the paper "Computational Geometry Column 23", (in the Internt. J. Comput. Geom. Appl. 4 (1994), 239-242) authors talk about three open problems in Computational Geometry. The first one is: Does tetrahedral bisection refinement keeps solid angles bound away from zero? I would like to know if that problem remains open or not. Thanks, Angel Plaza Departamento de Matem?ticas Edificio de Matem?ticas e Inform?tica Campus de Tafira Universidad de Las Palmas de Gran Canaria 35017-Las Palmas de Gran Canaria SPAIN Tfo: 34-928-458827 Fax: 34-928-458711 ------------- 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 mszczepa at ia.polsl.gliwice.pl Tue May 7 11:41:29 2002 From: mszczepa at ia.polsl.gliwice.pl (Marek Szczepanski) Date: Mon Jan 9 13:41:06 2006 Subject: No subject Message-ID: <003101c1f5d4$997666b0$790e9e9d@ztsmspc> To: Subject: ICCVG 2002 Call for Papers Date: Tue, 7 May 2002 16:23:15 +0200 MIME-Version: 1.0 Content-Type: multipart/mixed; boundary="----=_NextPart_000_0027_01C1F5E3.81D7CF30" X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 6.00.2600.0000 X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2600.0000 This is a multi-part message in MIME format. ------=_NextPart_000_0027_01C1F5E3.81D7CF30 Content-Type: multipart/alternative; boundary="----=_NextPart_001_0028_01C1F5E3.81D955D0" ------=_NextPart_001_0028_01C1F5E3.81D955D0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable International Conference on Computer Vision and Graphics 25-29 September, 2002, Zakopane, Poland The ICCVG'2002 intends to group the best researchers active in the field = of pictorial information exchange between computer and its environment. = The reviewing process and strict acceptance criteria assure high quality = of the accepted papers.=20 The Conference is planned as one track (oral and poster) presentations = and the number of participants is limited to max 100 persons.=20 The conference will be a forum for presentation of theoretical aspects, = methods, applications and systems of image processing. Unpublished = research papers are solicited, concerning the following main topics:=20 =B7 Modeling of human visual perception=20 =B7 Computational geometry=20 =B7 Geometrical models of objects and scenes=20 =B7 Illumination and reflection models and methods=20 =B7 Image formation=20 =B7 Noise modeling, reduction and cancellation=20 =B7 Image and video coding=20 =B7 Image filtering and enhancement=20 =B7 Biomedical image processing=20 =B7 Color and multispectral image processing=20 =B7 Pattern recognition in image processing=20 =B7 Image analysis and scene understanding=20 =B7 Motion analysis, visual navigation and active = vision=20 =B7 Visualization and graphical data presentation=20 =B7 Data visualization=20 =B7 Biomedical graphics=20 =B7 Computer-aided graphic design=20 =B7 3D imaging, shading and rendering=20 =B7 Computer animation=20 =B7 Graphics for internet and mobile systems=20 =B7 Virtual reality=20 =B7 Image and video databases=20 =B7 Digital watermarking=20 =B7 Multimedia applications=20 =B7 Computer art=20 =B7 Industrial applications=20 The programme will include: invited papers by leading researchers, = selected contributions in oral and poster sessions, open session and = social events.=20 DATE: 25-29 September, 2002.=20 SUBMISSIONS: Authors are requested to submit an electronic version of a manuscript in = English (max. 6 pages). Upon acceptance by the reviewers and Programme = Committee (selection criteria include originality of ideas, accuracy and = clarity of explanation), authors will be asked to submit a final version = (camera ready copy) of the paper, prepared in PDF format.=20 The best paper will be rewarded.=20 Declaration form is expected by 15.06.2002.=20 DEADLINES: Papers 30.06.2002. =20 Notification for acceptance 31.07.2002. =20 Submission of final version of papers 18.08.2002. =20 COMMITTEE: Chair of the Conference: K.WOJCIECHOWSKI (PL) =20 Vice-Chair of the Conference: W.S.MOKRZYCKI (PL) =20 Programme Committee Chair: J.L.KULIKOWSKI (PL) =20 PROGRAMME COMMITTEE: P. Bhattacharya (US) A. Materka (PL) =20 E. Bengtsson (SE) H. Niemann (DE) =20 A. Borkowski (PL) M. Nieniewski (PL) =20 D. Chetverikov (HU) L. Noakes (AUS) =20 L. Chmielewski (PL) M. Orkisz (FR) =20 J. Chojcan (PL) M. Paprzycki (US) =20 R. Choras (PL) J. Piecha (PL) =20 S. Dellepiane (IT) K. Plataniotis (CND) =20 M. Domanski (PL) H. Palus (PL) =20 U. Eckhardt (DE) D. Paulus (DE) =20 A. Gagalowicz (FR) J. Roerdink (NL) =20 E. Grabska (PL) P. Rokita (PL) =20 H. Heijmans (NL) R. Sara (CZ) =20 J.M. Jolion (FR) V. Skala (CZ) =20 A. Kasinski (PL) B. Smolka (PL) =20 R. Klette (NZ) J. Soldek (PL) =20 W. Kosinski (PL) G. Stanke (DE) =20 R. Kozera (AUS) R. Tadeusiewicz (PL) =20 H. Kreowski (DE) V. Valev (BG) =20 M. Kurzynski (PL) T. Vintsiuk (UA) =20 W. Kwiatkowski (PL) J. Zabrodzki (PL) =20 G. Levina (RU) M. Zaremba (CND) =20 V. Lukin (UA) =20 =20 REGISTRATION and FEES Your registration will be taken into account on the "first come -- first = served" basis. The conference fee should be received before August 10: = 350 Euro or 1200 ZLP. Payment should be made by bank transfer to: Bank: ING Bank Slaski, Oddzial Gliwice =20 Bank address: Zwyciestwa 28, PL 44-100 Gliwice, Poland =20 Account number: 10501298-2258874482 =20 SWIFT: INGBPLPW =20 Beneficiary: Association for Image Processing =20 Beneficiary Address: Swietokrzyska 21, PL 00-049 Warszawa, Poland Please add a notice: = ICCVG'2002 fee: =20 CONTACT ADDRESS: ICCVG'2002, =20 Marek Kazimierz Szczepanski, =20 Akademicka 16, =20 Silesian Technical University, =20 44-100 Gliwice, Poland =20 tel.: +48 32 2371912 =20 fax.: +48 32 2371165 =20 e-mail: mszczepa@ia.polsl.gliwice.pl =20 ICCVG'2002 on WWW: http://www.zts.ia.polsl.gliwice.pl/iccvg=20 DECLARATION FORM: Prospective participants are kindly requested to fill the Attached = Declaration Form and send it by ordinary mail or by fax to the = Conference Contact Address given above.=20 See you at the Conference in Zakopane ! K. Wojciechowski ------=_NextPart_001_0028_01C1F5E3.81D955D0 Content-Type: text/html; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable
International Conference on = Computer Vision=20 and Graphics

25-29=20 September, 2002, Zakopane, Poland

 

The ICCVG'2002 intends to group the best = researchers=20 active in the field of pictorial information exchange between computer = and its=20 environment. The reviewing process and strict acceptance criteria assure = high=20 quality of the accepted papers.

The Conference is planned as one track (oral = and poster)=20 presentations and the number of participants is limited to max 100 = persons.=20

The conference will be a forum for = presentation of=20 theoretical aspects, methods, applications and systems of image = processing.=20 Unpublished research papers are solicited, concerning the following main = topics:=20

=B7           = ;        =20 Modeling of human visual = perception=20

=B7           = ;        =20 Computational geometry =

=B7           = ;        =20 Geometrical models of = objects and=20 scenes

=B7           = ;        =20 Illumination and = reflection models=20 and methods

=B7           = ;        =20 Image formation =

=B7           = ;        =20 Noise modeling, reduction = and=20 cancellation

=B7           = ;        =20 Image and video coding =

=B7           = ;        =20 Image filtering and = enhancement=20

=B7           = ;        =20 Biomedical image = processing=20

=B7           = ;        =20 Color and multispectral = image=20 processing

=B7           = ;        =20 Pattern recognition in = image=20 processing

=B7           = ;        =20 Image analysis and scene=20 understanding

=B7           = ;        =20 Motion analysis, visual = navigation=20 and active vision

=B7           = ;        =20 Visualization and = graphical data=20 presentation

=B7           = ;        =20 Data visualization =

=B7           = ;        =20 Biomedical graphics =

=B7           = ;        =20 Computer-aided graphic = design=20

=B7           = ;        =20 3D imaging, shading and = rendering=20

=B7           = ;        =20 Computer animation =

=B7           = ;        =20 Graphics for internet and = mobile=20 systems

=B7           = ;        =20 Virtual reality =

=B7           = ;        =20 Image and video databases =

=B7           = ;        =20 Digital watermarking =

=B7           = ;        =20 Multimedia applications =

=B7           = ;        =20 Computer art

=B7           = ;        =20 Industrial applications =

The programme will include: invited papers by = leading=20 researchers, selected contributions in oral and poster sessions, open = session=20 and social events.
DATE: 25-29 September, 2002. =


SUBMISSIONS:

Authors are = requested to submit=20 an electronic version of a manuscript in English (max. 6 pages). Upon = acceptance=20 by the reviewers and Programme Committee (selection criteria include = originality=20 of ideas, accuracy and clarity of explanation), authors will be asked to = submit=20 a final version (camera ready copy) of the paper, prepared in PDF = format.=20

The best paper will be = rewarded.=20

Declaration form = is expected by=20 15.06.2002.

DEADLINES:

Papers

30.06.2002.

Notification for = acceptance

31.07.2002.

Submission of final version of=20 papers

18.08.2002.

 

COMMITTEE:

Chair of the=20 Conference:

K.WOJCIECHOWSKI = (PL)

Vice-Chair of the=20 Conference:

W.S.MOKRZYCKI = (PL)

Programme Committee=20 Chair:

J.L.KULIKOWSKI=20 (PL)

PROGRAMME=20 COMMITTEE:

P. Bhattacharya = (US)

A. Materka = (PL)

E. Bengtsson (SE)

H. Niemann = (DE)

A. Borkowski (PL)

M. Nieniewski = (PL)

D. Chetverikov = (HU)

L. Noakes = (AUS)

L. Chmielewski = (PL)

M. Orkisz = (FR)

J. Chojcan (PL)

M. Paprzycki = (US)

R. Choras (PL)

J. Piecha = (PL)

S. Dellepiane = (IT)

K. Plataniotis = (CND)

M. Domanski (PL)

H. Palus = (PL)

U. Eckhardt (DE)

D. Paulus = (DE)

A. Gagalowicz = (FR)

J. Roerdink = (NL)

E. Grabska (PL)

P. Rokita = (PL)

H. Heijmans (NL)

R. Sara (CZ)

J.M. Jolion (FR)

V. Skala = (CZ)

A. Kasinski (PL)

B. Smolka = (PL)

R. Klette (NZ)

J. Soldek = (PL)

W. Kosinski (PL)

G. Stanke = (DE)

R. Kozera (AUS)

R. Tadeusiewicz = (PL)

H. Kreowski (DE)

V. Valev = (BG)

M. Kurzynski (PL)

T. Vintsiuk = (UA)

W. Kwiatkowski = (PL)

J. Zabrodzki = (PL)

G. Levina (RU)

M. Zaremba = (CND)

V. Lukin (UA)

 

REGISTRATION=20 and FEES

 

Your registration = will be taken=20 into account on the "first come -- first served" basis. The conference fee should be received before = August=20 10: 350 Euro or 1200 ZLP.

Payment=20 should be made by bank transfer to:

Bank:

ING Bank Slaski, Oddzial=20 Gliwice

Bank address:

Zwyciestwa 28, PL 44-100 = Gliwice, Poland

Account number:

10501298-2258874482

SWIFT:

INGBPLPW

Beneficiary:

Association for Image=20 Processing

Beneficiary = Address:

Swietokrzyska 21, PL 00-049 = Warszawa, Poland Please add a notice: = ICCVG'2002=20 fee: <your full = name>

 

CONTACT=20 ADDRESS:

ICCVG'2002,

Marek Kazimierz=20 Szczepanski,

Akademicka = 16,

Silesian=20 Technical = University,

44-100 Gliwice, Poland

tel.: +48 32 = 2371912

fax.: +48 32 = 2371165

e-mail: mszczepa@ia.polsl.gliwice.pl=

ICCVG'2002 on WWW: = http://www.zts.ia.polsl.gliwice.pl/iccvg =

DECLARATION = FORM:
Prospective=20 participants are kindly requested to fill the Attached Declaration Form = and send=20 it by ordinary mail or by fax to the Conference Contact Address given = above.=20

 

See you at the Conference = in Zakopane=20 !
K.=20 Wojciechowski

 

 

------=_NextPart_001_0028_01C1F5E3.81D955D0-- ------=_NextPart_000_0027_01C1F5E3.81D7CF30 Content-Type: application/msword; name="iccvg2002_DECLARATION_FORM.doc" Content-Transfer-Encoding: base64 Content-Disposition: attachment; filename="iccvg2002_DECLARATION_FORM.doc" 0M8R4KGxGuEAAAAAAAAAAAAAAAAAAAAAPgADAP7/CQAGAAAAAAAAAAAAAAABAAAACQAAAAAAAAAA EAAACgAAAAEAAAD+////AAAAAAgAAAD///////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// ///////////////////////////////////////////////////////////////////////////c pWgAY+AJBAAAAABlAAAAAAAAgAAAAAAAAwAAUgcAANIPAAAAAAAAAAAAAAAAAAAAAAAAUgQAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA4AALQAAAAADgAAtAAAALQOAAAAAAAAtA4A AAAAAAC0DgAAAAAAALQOAAAAAAAAtA4AABQAAADIDgAAAAAAAMgOAAAAAAAAyA4AAAAAAADIDgAA AAAAAMgOAAAAAAAAyA4AAAoAAADSDgAAEAAAAMgOAAAAAAAA5A4AAFEAAADiDgAAAAAAAOIOAAAA AAAA4g4AAAAAAADiDgAAAAAAAOIOAAAAAAAA4g4AAAAAAADiDgAAAAAAAOIOAAAAAAAA4g4AAAIA AADkDgAAAAAAAOQOAAAAAAAA5A4AAAAAAADkDgAAAAAAAOQOAAAAAAAA5A4AAAAAAAA1DwAAWAAA AI0PAABFAAAA5A4AAAAAAAAAAAAAAAAAAAAAAAAAAAAAtA4AAAAAAADiDgAAAAAAAAAABAAFAAEA AgDiDgAAAAAAAOIOAAAAAAAAAAAAAAAAAAAAAAAAAAAAAOIOAAAAAAAA4g4AAAAAAADkDgAAAAAA AOIOAAAAAAAAtA4AAAAAAAC0DgAAAAAAAOIOAAAAAAAAAAAAAAAAAAAAAAAAAAAAAOIOAAAAAAAA 4g4AAAAAAADiDgAAAAAAAOIOAAAAAAAA4g4AAAAAAAC0DgAAAAAAAOIOAAAAAAAAtA4AAAAAAADi DgAAAAAAAOIOAAAAAAAAAAAAAAAAAAAwpXeiz/XBAcgOAAAAAAAAyA4AAAAAAAC0DgAAAAAAALQO AAAAAAAAtA4AAAAAAAC0DgAAAAAAAOIOAAAAAAAA4g4AAAAAAADiDgAAAAAAAOIOAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABJQ0NWRycyMDAyDSANIA1ERUNMQVJBVElPTiBGT1JN DSANIA0gICAgIEkgaW50ZW5kIHRvIHBhcnRpY2lwYXRlIGluIHRoZSBJQ0NWRycyMDAyIENvbmZl cmVuY2UgKikNDSANU2lnbmF0dXJlOiBfX19fX19fX19fX19fX19fX19fX19fDQdEYXRlOiBfX19f X19fX19fX19fX19fBwcgICAgICAgICAgICAgICAgICAgICAgICAgICANICAgIA0gDU5hbWUgYW5k IHRpdGxlOiBfX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fXyANIA1B ZmZpbGlhdGlvbjogX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19f X18NIA1BZGRyZXNzOiBfX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19f X19fX19fX18NX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19f X19fX19fX19fX19fDV9fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19f X19fX19fX19fX19fX19fXw0NICANIA1JIHBsYW46DSANICBbICBdIHRvIHRha2UgcGFydCBpbiB0 aGUgY29uZmVyZW5jZSBvbmx5ICANICBbICBdIHRvIHN1Ym1pdCBhIHBhcGVyIGluIGFuIG9yYWwg c2Vzc2lvbiANICBbICBdIHRvIHN1Ym1pdCBhIHBhcGVyIGluIGEgcG9zdGVyIHNlc3Npb24gDSAN IA0gDVRpdGxlIG9mIHRoZSBwYXBlcjoNX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19f X19fX19fX19fX19fX19fX19fX19fX19fX19fDV9fX19fX19fX19fX19fX19fX19fX19fX19fX19f X19fX19fX19fX19fX19fX19fX19fX19fX19fX19fXw1fX19fX19fX19fX19fX19fX19fX19fX19f X19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX18NX19fX19fX19fX19fX19fX19fX19f X19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fDV9fX19fX19fX19fX19fX19f X19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fXw1fX19fX19fX19fX19f X19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX18NIA0NDQ0qKSBu dW1iZXIgb2YgcGFydGljaXBhbnRzIGlzIGxpbWl0ZWQgdG8gMTAwIHBlcnNvbnMNDSEAkcQCoQEA nMQCncQCpIIupcZBpokFp4kFqIkFqYkFqgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADAAAL AwAADwMAACADAABeAwAAYAMAAJ4DAACfAwAAHQcAAFAHAABRBwAAUgcAAHUHAAD8+PP47vjs+O7n 5eMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACdQEAA2EJ BAldBABhCQRjFAADXQMACV0DAGEJBGMUAAhVgV0DAGEJBAAGXQMAYQkEAAZdAwBjHAAMAAMAAAsD AAANAwAADwMAACADAAAiAwAAJAMAAGEDAABiAwAAZAMAAIYDAACHAwAAngMAAJ8DAAC7AwAAwAMA AMIDAAAABAAAAgQAAD8EAABBBAAAfgQAALsEAAD4BAAA+QQAAPwEAAD+BAAABgUAAAgFAAA1BQAA YgUAAJAFAACSBQAAlAUAAJYFAACqBQAA5wUAACQGAABhBgAAngYAAP4AAAAAAAD8AAAAAAAA/AAA AAAAAPQAAAAAAAD8AAAAAAAA/AAAAAAAAPwAAAAAAAD8AAAAAAAA/AAAAAAAAPEAAAAAAADxAAAA AAAA8QAAAAAAANwAAAAAAAD8AAAAAAAA/AAAAAAAAPwAAAAAAAD8AAAAAAAA/AAAAAAAAPwAAAAA AAD8AAAAAAAA/AAAAAAAAPwAAAAAAAD8AAAAAAAA/AAAAAAAAPwAAAAAAAD8AAAAAAAA/AAAAAAA APwAAAAAAAD8AAAAAAAA/AAAAAAAAPwAAAAAAAD8AAAAAAAA/AAAAAAAAPwAAAAAAAD8AAAAAAAA /AAAAAAAAPwAAAAAAAD8AAAAAAAA/AAAAAAAAAAAAAAAAAAUAAAYARkBuEYAvhwAAmgBGBV0IgAA //////////8AAP//////////AAACDwAYAQAHDwAFAQ8IAAJoAcAhAAAAAQ8AAAEBACeeBgAA2wYA ABgHAAAaBwAAGwcAABwHAAAdBwAAUQcAAFIHAAD+AAAAAAAA/gAAAAAAAP4AAAAAAAD+AAAAAAAA /gAAAAAAAP4AAAAAAAD+AAAAAAAA/gAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQ8ACA4AEAAIAAEA SwAPAAAAAAAaAABA8f8CABoABk5vcm1hbAACAAAAAwBhCQQAJgABQPEA8gAmAAlIZWFkaW5nIDEA AAYAAQAFAggBCABVgV0EAGEJBAAAAAAAAAAAAAAAAAAAAAAiAEFA8v+hACIAFkRlZmF1bHQgUGFy YWdyYXBoIEZvbnQAAAAAAAAAAAAAACIA/k/x//IAIgAMTm9ybWFsIFRhYmxlAAIADwAGAGEVBGMY AAAAAABSBAAAAwBSBwAAAQD/////AAMAAHUHAAAEAAADAACeBgAAUgcAAAUABgD/QFEAFRKQAQAA VGltZXMgTmV3IFJvbWFuAAwQkAECAFN5bWJvbAALIpABAABBcmlhbAARMZABAABDb3VyaWVyIE5l dwANIpAB7gBWZXJkYW5hACIABAAAAIAYAPDEAgAAqQEAAAAAATxlRgE8ZUYNpGTGAgABAAAAoAAA AJADAAABAAEAAAAEAIMQBwAAAAAAAAAAAAAAAQABAAAAAQAAAAAAAAAAAADwEABFAAAACklDQ1ZH JzIwMDIAAAAWUHJ6ZW15c7NhdyCjYWdvZHpp8XNraRFNYXJlayBTemN6ZXBh8XNraQAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAIAAAAD AAAABAAAAAUAAAAGAAAABwAAAP7////9////DAAAAP7///8UAAAA/v////////////////////// ///////////////////+//////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////9SAG8AbwB0ACAA RQBuAHQAcgB5AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFgAF Af//////////AQAAAAAJAgAAAAAAwAAAAAAAAEYAAAAAAAAAAAAAAAAwpXeiz/XBAQsAAABAAwAA AAAAAFcAbwByAGQARABvAGMAdQBtAGUAbgB0AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAaAAIBAgAAAAMAAAD/////AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAQAAAAAAAAAQBDAG8AbQBwAE8AYgBqAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABIAAgH///////////////8AAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAagAAAAAAAAAFAFMAdQBtAG0AYQByAHkASQBuAGYAbwBy AG0AYQB0AGkAbwBuAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKAACAf////8EAAAA/////wAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAADYAQAAAAAAAAEAAAD+////AwAA AAQAAAAFAAAABgAAAAcAAAAIAAAACQAAAP7///8LAAAADAAAAP7///////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// ////////////////////////////////////////////////////////////AQD+/wMKAAD///// AAkCAAAAAADAAAAAAAAARhgAAABNaWNyb3NvZnQgV29yZCBEb2N1bWVudAAKAAAATVNXb3JkRG9j ABAAAABXb3JkLkRvY3VtZW50LjgA9DmycQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAD+/wAABQECAAAAAAAAAAAAAAAAAAAAAAABAAAA4IWf8vlPaBCrkQgAKyez2TAAAACoAQAAEgAA AAEAAACYAAAAAgAAAKAAAAADAAAAtAAAAAQAAADAAAAABQAAAOAAAAAGAAAA7AAAAAcAAAD4AAAA CAAAAAgBAAAJAAAAJAEAABIAAAAwAQAACgAAAFgBAAALAAAAZAEAAAwAAABwAQAADQAAAHwBAAAO AAAAiAEAAA8AAACQAQAAEAAAAJgBAAATAAAAoAEAAAIAAADiBAAAHgAAAAsAAABJQ0NWRycyMDAy AAAeAAAAAQAAAAAAAAAeAAAAFwAAAFByemVteXOzYXcgo2Fnb2R6afFza2kAAB4AAAABAAAAAAAA AB4AAAABAAAAAAAAAB4AAAAHAAAATm9ybWFsAAAeAAAAEgAAAE1hcmVrIFN6Y3plcGHxc2tpAAAA HgAAAAIAAAAyAL0FHgAAAB4AAABNaWNyb3NvZnQgV29yZCBmb3IgV2luZG8FAEQAbwBjAHUAbQBl AG4AdABTAHUAbQBtAGEAcgB5AEkAbgBmAG8AcgBtAGEAdABpAG8AbgAAAAAAAAAAAAAAOAACAP// /////////////wAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAoAAAC0AAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAA////////////////AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD///////////////8AAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAP///////////////wAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEA/v8DCgAA/////wYJ AgAAAAAAwAAAAAAAAEYYAAAARG9rdW1lbnQgTWljcm9zb2Z0IFdvcmQACgAAAE1TV29yZERvYwAQ AAAAV29yZC5Eb2N1bWVudC44APQ5snEAAAAAAAAAAAAAAAAAAOIEAAADAAAABwAAAAMAAAABAAAA CwAAAAAAAAALAAAAAAAAAAwQAAACAAAAHgAAAAsAAABJQ0NWRycyMDAyAAMAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAd3MgOTUAAABAAAAAAEbDIwAAAABA AAAAAH4TenXowQFAAAAAAPbxnc/1wQFAAAAAAPbxnc/1wQEDAAAAAQAAAAMAAACgAAAAAwAAAJAD AAADAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD+/wAABQEC AAAAAAAAAAAAAAAAAAAAAAABAAAAAtXN1ZwuGxCTlwgAKyz5rjAAAACEAAAABgAAAAEAAAA4AAAA BQAAAEAAAAAGAAAASAAAAAsAAABQAAAAEAAAAFgAAAAMAAAAYAAAAAIAAADiBAAAAwAAAAcAAAAD AAAAAQAAAAsAAAAAAAAACwAAAAAAAAAMEAAAAgAAAB4AAAALAAAASUNDVkcnMjAwMgADAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA= ------=_NextPart_000_0027_01C1F5E3.81D7CF30-- ------------- 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 jsbm at ams.sunysb.edu Mon May 13 13:28:06 2002 From: jsbm at ams.sunysb.edu (jsbm@ams.sunysb.edu) Date: Mon Jan 9 13:41:06 2006 Subject: Call for SoCG Business Meeting agenda items Message-ID: <200205131628.MAA22486@amirani.ams.sunysb.edu> Dear Members of the Computational Geometry Community, The annual SoCG business meeting will be held on Thursday, June 6 (6:00pm) at SoCG in Barcelona. We are currently collecting business agenda items for the meeting. Please let me know if you have announcements or discussion items to raise. SoCG'2003 will take place as part of FCRC in San Diego, California on June 8-10, 2003; we will hear from Steve Fortune regarding how plans are shaping up. The program committee chairs will also have a chance to speak. As is our tradition, we will be deciding the location for SoCG two years from now at the business meeting. Thus, we need to have those who want to propose to host it give at least a brief "sales pitch" at the business meeting. So that we can anticipate which proposals will be made, please let me know if you plan to make one. Also, if you would like to propose to host SoCG'2004 but will be unable to attend the business meeting in Barcelona, please either send a proxy or give me information that I can use to make the pitch for you. See you in Barcelona! Joe Mitchell Steering Committee jsbm@ams.sunysb.edu The SoCG Steering Committee members: Nina Amenta, Jeff Erickson, Danny Halperin, Marc van Kreveld, Joe Mitchell ------------- 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 rr29 at mcs.le.ac.uk Sat May 11 15:03:52 2002 From: rr29 at mcs.le.ac.uk (Rajeev Raman) Date: Mon Jan 9 13:41:06 2006 Subject: Chair + 4 Lectureships at Leicester, UK Message-ID: UNIVERSITY OF LEICESTER DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE The Department of Mathematics and Computer Science invites applications for five positions in Computer Science. One position is at the professorial level and the others are lectureships, which are at a similar level to assistant professor positions in North America. The Department is divided into three groups: Computer Science, Pure Mathematics and Applied Mathematics. The current research interests of the Computer Science group are in Logic, Algorithms & Complexity, Theory of Distributed & Reactive Systems and Semantics. The appointments are intended to diversify and strengthen the Computer Science group with regards to both teaching and research. The successful applicants will be ambitious, able to develop their own research within a multi-faceted environment, and have a strong research record and potential. This is a superb opportunity for persons of energy, drive and ambition to assume rewarding roles and to establish themselves in a young, dynamic and rapidly developing department. Information about all aspects of the Department is available from its web pages [http://www.mcs.le.ac.uk]. /\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ CHAIR IN COMPUTER SCIENCE (Ref: P9044) We are looking for a person of drive and enthusiasm to create a leading research group. Candidates whose research interests are complementary to the existing research groups are particularly encouraged to apply. Nevertheless, applications are welcomed from individuals with an outstanding research record in any area of Computer Science. The appointment will commence on a date to be agreed. The salary will be within the professorial range. Further particulars are available from: Personnel Office (Professorial Appointments), University of Leicester, University Road, Leicester, LE1 7RH, U.K. Tel: (+44) (0)116 252 2422, Fax: (+44) (0)116 252 5140, email: pt31@le.ac.uk, web: www.le.ac.uk/personnel/jobs. Candidates should submit one unbound copy of their application to the Personnel Office (Professorial Appointments). Closing date: 21st June 2002 /\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ LECTURERS A/B IN COMPUTER SCIENCE (Ref: A5485) 20,470 to 32,537 pounds pa (March 2002 pay scales) Available from 1st September 2002 LECTURER A IN COMPUTER SCIENCE (Ref: A5504) 20,470 to 24,435 pounds pa (March 2002 pay scales) Available for 2 years from 1st September 2002 Applications are invited for three lectureships (to start 1st September 2002 or as soon as possible thereafter) and a two-year lectureship in Computer Science (to start 1st September 2002). There is no restriction regarding the area of research and applicants with expertise in any area of Computer Science are welcomed. Application forms and further particulars are available (by quoting the reference) from Personnel Office, University of Leicester, University Road, Leicester, LE1 7RH, U.K. Tel: (+44) (0)116 252 5114, Fax: (+44) (0)116 252 5140, email: jobs@le.ac.uk, web: www.le.ac.uk/personnel/jobs. Closing date: 10th June 2002 /\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ Candidates who are interested in any of these positions are invited, if they so wish, to contact either of: Prof Rajeev Raman Professor Rick Thomas, Head of Computer Science Head of Department, telephone (+44) (0)116 252 3894 telephone (+44) (0)116 252 3885 email rr29@mcs.le.ac.uk e-mail rmt@mcs.le.ac.uk who will be pleased to discuss the positions further. ------------- 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 Tue May 14 11:07:08 2002 From: emo at inf.ethz.ch (Emo Welzl) Date: Mon Jan 9 13:41:06 2006 Subject: Pre-Doc Program in "Combinatorics, Geometry, and Computation", ETH Zurich Message-ID: <200205140807.KAA19117@shadow.inf.ethz.ch> Call for Applications Pre-Doc Program Combinatorics, Geometry, and Computation October 2002 -- March 2003 http://www.cgc.ethz.ch/ (At ETH Zurich; part of Berlin/Zurich Graduate Program "Combinatorics, Geometry, and Computation") ETH Zurich offers a one-semester study program that focusses on the preparation of a Ph.D. in areas like: Discrete and Computational Geometry; Computer Graphics and Vision; Networks; Algorithms Design, Analysis and Implementation; Optimization. Building blocks of the program are four 5-weeks research oriented courses, a project and the preparation of a proposal for a Ph.D.; see schedule, speakers (including guests J. Beck, J. Bloemer, Ch. Papadimitriou, and A. Steger) and topics below. ETH offers a limited number of scholarships of Sfr 2'200 per month (for a six months period) for students with a diploma or master in a field related to the topics of the program (including computer science, mathematics, electrical engineering, and physics). There is a possibility of continuing a Ph.D. in the Berlin/Zurich Graduate Program (although it is not automatically implied by acceptance to the Pre-Doc program). Students who plan to continue their Ph.D. at some other university are also welcome. Advanced diploma or master students can be considered for a one-semester exchange program as well, if a feasible arrangement with their home universities can be made. The language of the program is English. The program is open to applicants of all nationalities. Students who receive a scholarship are expected to provide teaching assistance. Applications with curriculum vitae, copies of certificates, thesis, areas of interest, a letter of recommendation from the thesis advisor should be sent to: Emo Welzl Institut Theoretische Informatik ETH Zentrum CH-8092 Zurich Switzerland cgc.graduate@inf.ethz.ch Application deadline is May 31, 2002. Applicants are notified of results about one month after the respective deadline. ---------------------------------------------------------------- COURSES Courses will be held two days a week, for a five-weeks period. As a rough framework, every day includes 3 hours of lectures, exercises in groups, and a discussion of exercises. --------- RandAlgs Randomized Algorithms Ch. Papadimitriou (UC Berkeley; USA), E. Welzl (Mo&Tu, Oct 21 - Nov 22, 2002) Randomized algorithms have by now emerged into many fields, and have lead to several improvements and simplifications compared to deterministic methods. We will discuss applications in several areas, including optimization, approximate counting and solving of hard problems (e.g. SAT). The emphasis will be on understanding of the basic methods, so that they can be applied in several situations. --------- ApproxAlgs Approximation: Theory and Algorithms J. Bloemer, M. Cochand, T. Erlebach, B. Gaertner, A. Steger, P. Widmayer (Th&Fr, Oct 21 - Nov 22, 2003) This course is concerned with approximation algorithms for NP-hard optimization problems. The topics covered include: basic and advanced approximation algorithms for selected problems; more general techniques such as linear programming relaxation and derandomization; inapproximability and the PCP concept. --------- GeomMod Surface Representations and Geometric Modeling M. Gross (Mo&Tu, Jan 6 - Feb 7, 2003) Recent advances in 3D digital geometry processing have spawned new generations of methods for the representation and interactive manipulation of large scale graphics models. This course will discuss some of the latest developments in geometric modeling and surface representations. The first such as splines and NURBS, and we will introduce the basic concepts of differential geometry. The second part of the course will address more recent developments in geometry processing inlcuding subdivision, smoothing, and geometric filtering. --------- PosGames Positional Games and Algorithms J. Beck (Rutgers University, USA) (Th&Fr, Jan 6 - Feb 7, 2003) In the last few years I keep writing a book entitled `positional games', which would be the first book on the subject. `Positional games' is completely different from both the traditional Neumann-type "game theory" and the Berlekamp-Conway-Guy type "Nim-like games" (see the well-known 2-volumed `Winning Ways' of the three authors). `Positional games' is about `Tic-Tac-Toe-like' board games, and is closely related to Ramsey theory, Matching theory and the Erdos-type "probabilistic method" (see the well-known book of Alon-Spencer). The winning and drawing strategies are effective potential function algorithms: this explains the word `algorithms' in the title. This is a brand new subject which is full of exciting open problems. The list of the subjects that we are going to cover is (1) Tic-Tac-Toe-like games, Ramsey games, game-graph and game-tree, pairing strategy, potential functions, (2) Game-theoretic first moment method, (3) Game-theoretic second moment method, (4) Graph games and random graphs, (5) Tic-Tac-Toe in higher dimensions, (6) Algorithmic and game-theoretic Lovasz Local Lemma, complexity problems. Prerequisites: Almost nothing -- it is a self-contained course, but a knowledge of the simplest concepts of combinatorics, and reasonable problem-solving skills are expected. No textbook is available: I am going to give hand-outs and problem-sheets. --------- CompVis Selected Topics in Computer Vision L. van Gool, B. Schiele, G. Székely (Th&Fr, Jan 6 - Feb 7, 2003) The class covers various fundamental as well as advanced techniques in computer vision. A particular emphasis is on visual object recognition using different approaches. Two alternative schools are described and compared: appearance vs. model based. These are complemented with novel, hybrid solutions, built upon invariance theory. A second emphasis is on techniques to characterize object shape and binary scenes. Basic concepts of topology and metrics on discrete image rasters are investigated. Time permitting, several learning techniques in the context of visual recognition are discussed. --------------------------------------- SCHEDULE --------------------------------------- Oct 1 Reading assignments --------------------------------------- Oct 21 Courses -Nov 22 Mo&Tu RandAlgs Th&Fr ApproxAlgs Nov 27 Exams --------------------------------------- Nov 28 Projects, reading assignments -Dec 19 and presentations --------------------------------------- Jan 6 Courses -Feb 7 Mo&Tu GeomMod Th&Fr PosGames or CompVis Feb 12 Exams --------------------------------------- Feb 13 Preparation of Ph.D. proposal -Mar 28 and presentations --------------------------------------- ------------- 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 Tue May 14 11:14:36 2002 From: emo at inf.ethz.ch (Emo Welzl) Date: Mon Jan 9 13:41:06 2006 Subject: CGC Fall School on Algorithms for Hard Problems Message-ID: <200205140814.KAA19129@shadow.inf.ethz.ch> Second Announcement Fall School on Algorithms for Hard Problems September 23-27, 2002 Schwarzenberg, Switzerland http://www.cgc.ethz.ch/ In connection with the European Graduate Program "Combinatorics, Geometry, and Computation" (CGC) a Fall School on Algorithms for Hard Problems will be held in September 2002. The themes of the school are algorithmic techniques for dealing with hard optimization problems arising in practice. The focus is on algorithms with provable performance guarantees. In particular, the school will cover recent advances in the design and analysis of approximation algorithms, on-line algorithms, and fixed-parameter tractable algorithms in application domains such as machine scheduling, facility location and computational biology. The following lectures will be taught at the school (in this order): - David Shmoys (Cornell University): Approximation algorithms for clustering problems: a case study in algorithm design techniques - Gerhard Woeginger (University of Twente): Approximation algorithms for scheduling problems - Susanne Albers (Universitaet Freiburg): On-line algorithms - Angelika Steger (Technische Universitaet Muenchen): Stochastic Scheduling - Rolf Niedermeier (Universitaet Tuebingen) and Peter Rossmanith (Technische Universitaet Muenchen): Fixed-Parameter Algorithms The abstracts of the lectures and a preliminary schedule can be found here: http://www.tik.ee.ethz.ch/~the/school/abstracts.html The intended audience of the school are final-year master students as well as doctoral students in fields related to the themes of the school. Participants should have a basic knowledge of algorithms and should be interested in learning about the state of the art in this area. The school will also be a good opportunity to get to know other people working in the field and to establish contacts that may lead to research collaborations in the future. ORGANIZATION AND LOCATION The school is organized within the European graduate program "Combinatorics, Geometry, and Computation" (http://www.cgc.ethz.ch/), which brings together ETH Zurich and the three universities of Berlin. It will take place in Bildungszentrum Matt in Schwarzenberg (Switzerland), a village in the vicinity of the Pilatus mountain range that is reachable in 30 minutes from Lucerne and in 90 minutes from Zurich (by train and bus). See also: http://www.seminarguide.ch/hotel.asp?hotel=168®ion=13 SCHOOL SCHEDULE Participants are expected to arrive in Schwarzenberg on Sunday, September 22, 2002 before dinner. Lectures will then be given from Monday to Friday. Each lecturer will teach one or several lectures, covering half a day or a full day of the school's program. Lectures will be accompanied by exercises that can be solved by the students during times especially reserved for this purpose. There will be an excursion on Wednesday afternoon. The school ends Friday afternoon at 5.00 pm. Check http://www.tik.ee.ethz.ch/~the/school/abstracts.html for a more detailed preliminary program. PARTICIPATION Participation is open to all qualified applicants, but the number of participants will be limited to a maximum of about 30. There will be no participation fee, but an amount of 500 SFr. (Swiss Francs) has to be paid to cover the costs for accomodation (shared double-room) and meals (from Sunday evening to Friday). Students who want to participate in the school should send an application letter with a curriculum vitae (stating also their previous knowledge in fields related to the themes of the school) and a brief letter of reference by a university professor to the following address (e-mail is fine): Prof. Thomas Erlebach Institut TIK, ETH Zurich Gloriastrasse 35 CH-8092 Zurich Switzerland Email: erlebach@tik.ee.ethz.ch Fax: +41-1-632-1036 Phone: +41-1-632-7050 Since the number of participants is limited, we recommend to apply AS SOON AS POSSIBLE! Applications received before June 5, 2002 will definitely be considered. Applications received after June 5 (and until July 21, 2002) will be considered only if places are still available. CONTACT For further information, please contact one of the organizers: - Thomas Erlebach, ETH Zurich, CH-8092 Zurich, erlebach@tik.ee.ethz.ch - Peter Widmayer, ETH Zurich, CH-8092 Zurich, widmayer@inf.ethz.ch The website for the school is: http://www.tik.ee.ethz.ch/~the/school/ ------------- 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 morin at cs.carleton.ca Wed May 15 09:56:03 2002 From: morin at cs.carleton.ca (Pat Morin) Date: Mon Jan 9 13:41:06 2006 Subject: 2nd CFP: ISAAC 2002 Message-ID: <3CE25AE3.C7A1786E@cs.carleton.ca> Thirteenth International Symposium on Algorithms and Computation ISAAC 2002 Vancouver, Canada November 21-23, 2002 The 13th Annual International Symposium on Algorithms and Computation (ISAAC 2002) will be held in Vancouver, Canada on November 21-23, 2002 at the Delta Pinnacle Hotel, with a reception on the evening of November 20. ISAAC 2002 is coupled with FOCS 2002 which will be held at the same location from November 16-19. This is the first time that ISAAC has ventured into North America. The main themes for ISAAC 2002 are: o Algorithms and Data Structures, o Computational Complexity o Computational Geometry, o Approximation Algorithms, o Randomized Algorithms, o Graph Drawing and Graph Algorithms, o Combinatorial Optimization, o Computational Biology, o Computational Finance, o Cryptography, o Parallel and Distributed Computing. SUBMISSIONS Authors are invited to submit papers presenting original and unpublished research results on the symposium themes listed above. Papers in applied areas with a strong foundational emphasis are also welcome. Submissions should not exceed 12 pages using 11 point or larger font. Authors who feel that more details are necessary may include a clearly marked appendix which will be read at the discretion of the Program Committee. Selected papers from the conference will be invited for submission to a special issue of Theory of Computing Systems. Submissions to the symposium this year will only be conducted electronically either by e-mail or web. Hard-copy submissions will not be accepted. Details on the submission procedure are outlined in the website: http://www.cs.carleton.ca/isaac2002. Any inquiries should be directed to isaac2002@cs.carleton.ca. For an accepted paper to be included in the proceedings, at least one of the authors must commit to presenting the paper at the symposium. Accepted papers will be published in Lecture Notes in Computer Science, Springer-Verlag. ORGANIZING COMMITTEE o Binay Bhattacharya, Simon Fraser, Canada o Prosenjit Bose, Carleton University, Canada o Arvind Gupta, Simon Fraser University, Canada o Tiko Kameda, Simon Fraser University, Canada PROGRAM COMMITTEE o Prosenjit Bose, Chair, Carleton University, Canada o Tetsuo Asano, JAIST, Japan o Binay Bhattacharya, Simon Fraser Univ., Canada o Hans Bodlaender, Utrecht University, Pays Bas o Rudolf Fleischer, HKUST, Hong Kong o Naveen Garg, IIT Delhi, India o Arvind Gupta, Simon Fraser University, Canada o Wen-Lian Hsu, Academia Sinica, Taiwan o David Kirkpatrick, Univ. British Columbia, Canada o Danny Krizanc, Wesleyan University, USA o Ming Li, University of Waterloo, Canada o Michael Molloy, University of Toronto, Canada o Pat Morin, Carleton University, Canada o Ian Munro, University of Waterloo, Canada o Lata Narayanan, Concordia University, Canada o Rajeev Raman, University of Leicester, UK o Sunil Shende, Rutgers University, USA o Hisao Tamaki, Meiji University, Japan o Roberto Tamassia, Brown Univeristy, USA o Denis Therien, McGill University, Canada o Takeshi Tokuyama, Tohoku University, Japan IMPORTANT DATES o Submission Deadline: June 3, 2002 o Notification: July 22, 2002 o Deadline for Proceedings: August 9, 2002 INVITED SPEAKERS o Luc Devroye, McGill University, Canada o Janos Pach, New York University, USA o Nicholas Pippenger, Univ. British Columbia, Canada ------------- 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 icalp2002 at informatica.uma.es Thu May 16 12:11:42 2002 From: icalp2002 at informatica.uma.es (icalp2002@informatica.uma.es) Date: Mon Jan 9 13:41:06 2006 Subject: ICALP 2002. Last news Message-ID: <200205160911.LAA24392@sol10.lcc.uma.es> We apologize for possible multiple postings. Dear Sir/Madam, We consider that this conference can be of your interest (see the last news below). For this reason we remember you that early registration is near to finish (May 27, 2002). The last news are: 1) The program of ICALP 2002 is available on http://www.lcc.uma.es/ICALP2002, Schedule. 2) The preliminary program of the Global Computing event is also available in the same site (and directly on: http://www.cs.uu.nl/groups/AD/GC.html). 3) Finally, the committee of Goedel prize 2002 reached a unanimous decision. The Goedel prize 2002 is Géraud Sénizergues, for his paper on the decidability problem for deterministic pushdown automata. L(A) = L(B), Decidability results from complete formal systems Theoretical Computer Science, Vol 251 (2001), pages 1 - 166. You can access to the abstract of this paper on http://www.lcc.uma.es/ICALP2002, Invited talks. See you on ICALP 2002 in Málaga. Best regards, Rafael Morales ------------- 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 hert at mpi-sb.mpg.de Fri May 17 19:11:38 2002 From: hert at mpi-sb.mpg.de (Susan Hert) Date: Mon Jan 9 13:41:06 2006 Subject: [DMANET] CGAL 2.4, Computational Geometry Algorithms Library Message-ID: We are pleased to announce release 2.4 of CGAL, the Computational Geometry Algorithms Library. Major additions in this release include: o Support for Visual C++ 7.0, SunPro 5.3, and g++ 3.1 o A sweep-line algorithm to compute arrangements of curves o Quicker insertion functions for planar maps o 2D constrained triangulations with intersecting constraints o running time improvements for 3D triangulations o Polyhedral surface design introduced with release 2.3 is now supported on Visual C++ 7.0 o A widget for visualization of 2D CGAL objects based on Trolltech's Qtwidget. o Microsoft Visual Studio project files for the library, examples, and demos. See http://www.cgal.org/releases_frame.html for a more complete list of changes. The CGAL project is a collaborative effort to develop a robust, easy-to-use, and efficient C++ software library of geometric data structures and algorithms. The CGAL library contains: o Basic geometric primitives such as points, vectors, lines, predicates for testing things such as relative positions of points, and operations such as intersections and distance calculation. o A collection of standard data structures and geometric algorithms, such as convex hull, (Delaunay) triangulation, planar map, polyhedron, smallest enclosing sphere, and multidimensional query structures. o Interfaces to other packages, e.g. for visualization, and I/O, and other support facilities. For further information and for downloading the library and its documentation, please visit the CGAL web page: http://www.cgal.org/ Should you have any questions or comments, please send a message to contact@cgal.org ------------------------------------------------------------------------- Susan Hert hert@mpi-sb.mpg.de MPI fuer Informatik Phone: ++49 681 9325 116 Stuhlsatzenhausweg 85 Fax : ++49 681 9325 199 66123 Saarbruecken, Germany http://www.mpi-sb.mpg.de/~hert ------------------------------------------------------------------------- ********************************************************** * * 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 vshapiro at engr.wisc.edu Wed May 29 12:27:18 2002 From: vshapiro at engr.wisc.edu (Vadim Shapiro) Date: Mon Jan 9 13:41:06 2006 Subject: FINAL PROGRAM for 7th ACM Symposium on Solid Modeling Message-ID: <4.2.2.20020529112428.00b3be70@me.engr.wisc.edu> Dear Colleagues, please find enclosed the final program for the 7th ACM SYMPOSIUM on SOLID MODELING AND APPLICATIONS June 17-21, 2002 http://www.mpi-sb.mpg.de/conferences/sm02 sponsored by ACM SIGGRAPH & EUROGRAPHICS The Solid Modeling 2002 symposium will be held at the Max-Planck- Institut f?r Infomatik, in Saarbr?cken, Germany. In addition to technical papers in plenary sessions, the program for Solid Modeling 2002 will include: * tutorials * keynote lectures * best paper awards * social program For detailed information about the conference and registration see: >>> http://www.mpi-sb.mpg.de/conferences/sm02 <<< If you have any further questions, please contact sm02@mpi-sb.mpg.de. Sincerely, Jens Vorsatz (Solid Modeling '02 - local coordinator) ------------------------------------- ********************************************** * 7th SYMPOSIUM on * * SOLID MODELING AND APPLICATIONS * * June 17-21, 2002 * * * * PROGRAM * * * ********************************************** ------------ Monday, June 17 ----------- 7:30-17:00 Registration for Tutorials & Conference 9:00-12:00 & 13:30-16:30 Tutorial T1: Geometric Algorithms for Planning and Simulation Tasks in Virtual Prototyping Organizer: E. Schoemer, MPI Informatik 9:00-12:00 & 13:30-16:30 Tutorial T2: A Framework for the Acquisition, Processing and Interactive Display of High Quality 3D Models Organizer: H.-P. Seidel, MPI Informatik ------------ Tuesday, June 18 ----------- 7:30-19:30 Registration for Tutorials & Conference 9:00-12:00 & 13:30-16:30 Tutorial T3: Compression and Progressive Transmission of 3D Models Organizer: Jarek Rossignac, Georgia Institute of Technology 9:00-12:00 & 13:30-16:30 Tutorial T4: Handling Large Geometric Datasets: Proximity Queries and Interactive Walkthroughs Organizer: Dinesh Manocha and Ming Lin, University of North Carolina, Chapel Hill ------------ Wednesday, June 19 ----------- 7:30-17:20 Registration 8:15-8:30 Conference Opening Remarks 8:30-9:45 SESSION 1: Modeling I Chair: M. C. Hoffman Topological Framework for Part Families S. Raghothama, V. Shapiro A Survey of the Persistent Naming Problem D. Marcheix, G. Pierra ESOLID- A System for Exact Boundary Evaluation J. Keyser, T. Culver, M. Foskey, S. Krishnan, D. Manocha Break 10:15-11:30 SESSION 2: Curves and Surfaces Chair: B. Falcidieno A Generic Approach to Free Form Surface Generation J. Cotrina-Navau, N. Pla-Garcia, M. Vigo-Anglada Adaptive Implicit Modeling using Subdivision Curves and Surfaces as Skeletons A. Angelidis, M.-P. Cani Hierarchical Extraction of Iso-Surfaces with Semi-Regular Meshes K. Hormann, U. Labsik, M. Meister, G. Greiner Lunch 13:00-14:00 Invited Talk 1: CSG-Brep Duality and Compression Speaker: J. Rossignac Chair: R. Joan-Arinyo 14:00-15:15 SESSION 3: Model Simplification Chair: J. Vandenbrande Reconstruction of Feature Volumes and Feature Suppression S. Venkataraman, M. Sohoni Biorthogonal Wavelets for Subdivision Volumes M. Bertram Removal of Blends from Boundary Representation Models S. Venkataraman, M. Sohoni, R. Rajadhyaksha 15:15-16:30 Break and Poster Session I Interactive Sculpturing and Visualization of Unbounded Voxel Volumes R. B?nning, H. M?ller Web Based Analysis M. P. Carroll, C. M. Hawkins A New Solid Subdivision Scheme based on Box Splines Y.-S. Chang, K. T. McDonnell, H. Qin Basic Components of the DIJA Project F. Danesi, L. Denis, Y. Gardan E. Perrin Interacting with Parametrized Geometric Objects using lambda-terms J.-F. Dufourd, S. Luther Deformation Of Finite Element Meshes Using Directly Minipulated Free-Form Deformation N. Frisch, T. Ertl Constraint-Based Motion Planning for Virtual Prototyping M. Garber, M. C. Lin Subdivision-Based Multilevel Methods for Large Scale Engineering Simulation of Thin Shells S. Green, G. Turkiyyah, D. Storti Using Shape Distribution to Compare Solid Models C. Y. Ip, D. Lapadat, L. Sieger, W. C. Regli Multiresolution Rendering By Sewing Trimmed NURBS Surfaces F. Kahlesz, ?. Bal?zs, R. Klein Edgebreaker: A Simple Compression for Surfaces with Handle H. Lopes, J. Rossignac, A. Safanova, A. Szymczak, G. Tavares Sketch- and Constraint-based Design of B-Spline Surfaces P. Michalik, D. H. Kim, B. D. Bruderlin Multi-resolution and Slice-oriented Feature Extraction and Segmentation of Digitized Data G. Patan?, M. Spagnuolo Application of Feature Technology to Modeling and Dimensioning the Intermediate Geometry of Automotive Powertrain Components M. Ramesh, N. Belludi, D. Yip-Hoi, D. Dutta, P. Wascher Efficient Collision Detection for Curved Solid Objects E. Sch?mer, J. Reichel, T. Warken, C. Lennerz Directional Offset of a 3D Curve H. Shin, S. K. Cho Cutting 3D Freeform Objects with Genus-n into Single Boundary Surfaces Using Topological Graphs D. Steiner, A. Fischer 16:30-17:20 SESSION 4: Constraints Chair: B. Bruderlin Solving Spatial Basic Geometric Constraint Configurations with Locus Intersection X.-S. Gao, C. M. Hoffmann, W.-Q. Yang Revisiting Decomposition Analysis of Geometric Constraint Graphs R. Joan-Arinyo, A. Soto-Riera, S. Vila-Marta, J. Vilaplana-Pasto 17:30-19:00 Welcome Reception ------------ Thursday, June 20 ----------- 7:30-17:00 Registration 8:30-9:45 SESSION 5: Reverse Engineering Chair: R.Martin A Local Coordinate System on a Surface J. - D. Boissonnat, J. Flototto Range-Image Segmentation and Model Reconstruction Based on a Fit-and-Merge Strategy M. Djebali, M. Melkemi, N. Sapidis A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces D. Attali, J. - D. Boissonnat Break 10:15-11:30 SESSION 6: Triangulation Chair: R. Klein Smooth Surface and Triangular Mesh: Comparison of the Area, the Normals and the Unfolding J. - M. Morvan, B. Thibert A Multi-Resolution Topological Representation for Non-Manifold Meshes L. De Floriani, P. Magillo, E. Puppo, D. Sobrero Dual/Primal Mesh Optimization for Polygonized Implicit Surfaces Y. Ohtake, A. G. Belyaev Lunch 13:00-14:00 Invited Talk 2: Interactive Sculpting with Implicit Surfaces Speaker: M. - P. Cani Chair: A. Pasko 14:00-15:15 SESSION 7: Modeling II Chair: S. Allen Estimating Depth from Line Drawings P. A. C. Varley, R. R. Martin Cellular-Fnctional Modeling of Heterogeneous Objects V. Adzhiev, E. Kartasheva, T. Kunii, A. Pasko, B. Schmitt Fast Volumetric CSG Modeling Using Standard Graphics System D. Liao, S. Fang 15:15-17:00 Break and Poster Session II (presentations: cf. Poster Session I) ... 19:00-22:00 Symposium Banquet ------------ Friday, June 21 ----------- 7:30-11:00 Registration 8:00-9:15 SESSION 8: Geometric Reasoning Chair: G. Turkiyyah Linear One-sided Stability of MAT for Weakly Injective 3D Domain S. W. Choi, H.-P. Seidel Approximate Medial Axis as a Voronoi Subcomplex T. K. Dey, W. Zhao An Algorithm for Deciding Similarities of 3-D Objects S. Mukai, S. Furukawa, M. Kuroda Break 9:30-10:30 Invited Talk 3: Discrete Models for Geometric Objects Speaker: P. Brunet Chair: N. Sapidis 10:30-11:45 SESSION 9: Engineering Applications Chair: H. Qin Application of Haptic Navigation to Modify Free-Form Surfaces through Specified Points and Curves M. Higashi, N. Aoki, T. Kaneko A Collaborative Framework for Integrated Part and Assembly Modeling R. Bidarra, N. Kranendonk, A. Noort, W. F. Bronsvoort Constraint-based Design of Optimal Transport Elements M. Drumheller 11:45-12:15 Closing Comments and Plans for next Year (SM-03) Lunch ---------------------------------------------------------------------------- ------------- Symposium Co-Chairs Program Co-chairs Hans-Peter Seidel Kunwoo Lee Vadim Shapiro Nick Patrikalakis ------------- 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.