From Herve.Bronnimann at sophia.inria.fr Wed Feb 3 07:12:04 1999 From: Herve.Bronnimann at sophia.inria.fr (Herve Bronnimann) Date: Mon Jan 9 13:40:55 2006 Subject: CG'99 [accepted papers] Message-ID: <19990203071203.A4492@sargas.inria.fr> [Apologies if you get this message twice] This is a list of accepted papers to CG'99, which will take place in Antibes in March 15-16-17 1999. For more information and registration, see http://www.inria.fr/prisme/cg99/ February 10th, 1999: Deadline for hotel registration February 28th, 1999: Deadline for registration See you in Antibes, -- Herv? Br?nnimann Organizer CG'99 Two problems on separability with lines and polygonals Ferran Hurtado, Merce Mora, Pedro A. Ramos, Carlos Seara Efficient algorithm for finding 2 largest empty circles Sergei Bespamyatnikh Improved algorithms for placing undesirable facilities Matthew J. Katz, Klara Kedem, Michael Segal Geometric Solution concepts for planar ordered Weber Problems Stefan Nickel, Justo Puerto, Ansgar Weissler Dynamic Geometry I: the Problem of Continuity Ulrich H. Kortenkamp, Juergen Richter-Gebert Dynamic geometry II: Application Ulrich H. Kortenkamp, Juergen Richter-Gebert Constrained approximate pattern matching and its applications Frank Nielsen Implementing main-memory point-enclosure algorithms Ulf Erikson A simple and efficient sequential encoding for triangle meshes Leila de Floriani, Paola Magillo, Enrico Puppo Arrangement of curves in the plane: what does ``equivalence'' mean? Manuela Neagu Polygonal decompositions into singular and regular regions Jairo Rocha On some polyhedra covering problems Cao An Wang, Bo-Ting Yang Computations with tight bounding volumes for general parametric surfaces Wilhelm Barth and Ernst Huber Optimal illumination of points with restricted flood-light A. Calatayud, J. Garcia, F. Gomez Exact L_infinity nearest neighbor search in high dimensions Helmut alt, Ulrich Hoffmann A simple and efficient algorithm for high-quality line labeling Pankaj K. Agarwal, Lars Knipping, Marc van Kreveld, Tycho Strijk, Alexander Wolff The Minkowski sum of a convex polyhedron and a polyhderal terrain Antonio Hernandez-Barrerra, Subhas Chandra Nandy, Tetsuo Asano Flipping edges in triangulations on the cylinder Carmen Cortes, Clara I. Grima, Alberto Marquez Parallel flips on planar triangulations Jerome Galtier, Stephane Perennes Delaunay graph on a prescribed graph Manual Abellanas, Frank Harary The design and implementation of planar maps in CGAL Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan 3D Triangulations in CGAL Monique Teillaud A geometric approach to protein identification in 2D electrophoretic gel images Frank Hoffmann, Klaus Kriegel, Carola Wenk Further results on arithmetic filters for geometric predicates Olivier Devillers, Franco Preparata Smooth shape reconstruction Jean-Daniel Boissonnat, Fr?d?ric Cazals, Stephane Nullans Matching shapes with respect to the symmetric difference Helmut Alt, Christian Knauer Computing the shape of a planar point set Mahmoud Melkemi, Mourad Djebali Searching a goal on m rays within a fixed distance Christian Icking, Rolf Klein, Elmar Langetepe On the zookeeper's problem Haakan Jonsson Polar diagrams of geometric objects Clara I. Grima, Alberto Marquez, Lidia Ortega Sweeping along a polygonal line to construct a Delaunay diagram Pierre Kauffmann, Jean-Claude Spehner Non-degeneracy properties of 3D longest-edge algorithms for the quality refinement of triangulations Maria-Cecilia Rivara An algorithm for drawing a ring cover Ala Eddine Barouni, Ali Jaoua, Nejib Zaguia Turn regularity and optimal drawings of orthogonal representations Stina Bridgeman, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Roberto Tamassia, Luca Vismara Orthogonal triangles in the plane M.A. Garrido, Alberto Marquez, J.R. Portillo, P. Reyes Graphs of non-crossing matchings Maria del Carmen Hernando, Ferran Hurtado, Marc Noy Space complexity of sectoral neighborhood spanners Matthias Fischer, Tamas Lukovski, Martin Ziegler On the topological walk method Pierre Angelier, Michel Pocchiola, Stephane Riviere Using train trascks to show that a trivial knot may require exponential-size spanning disks Joel Hass, Jack Snoeyink, William P. Thurston The periodicity of integral convex hulls for conics in $\E^2$ Helymar Balza-Gomez Rectangular duals and box-representation in the cylinder Natalia de Castro, Francisco Javier Cobos, Juan Carlos Dana, Alberto Marquez An aperiodic tiles machine Jos? Caceres, Alberto Marquez ------------- 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 From Jeff.Vitter at sophia.inria.fr Wed Feb 3 10:24:39 1999 From: Jeff.Vitter at sophia.inria.fr (Jeff Vitter) Date: Mon Jan 9 13:40:55 2006 Subject: Postdoc opportunity at Duke University Message-ID: <14008.5430.139966.629396@gemma.inria.fr> VISITING ASSISTANT PROFESSOR POSITION AVAILABLE Department of Computer Science Duke University A postdoctoral position at the level of Visiting Assistant Professor of Computer Science is available in the Department of Computer Science at Duke University, under the supervision of Prof. Jeff Vitter. Duke is an equal opportunity employer. The position is for one year and can be extended for additional years by mutual consent. Applicants must have clearly demonstrated experience and skills in systems development. Familiarity with external memory algorithms and database algorithms is a definite plus. Teaching responsibilities include one research seminar per year if desired. The position will include membership in the Center for Geometric Computing, a collaborative effort funded by the Army Research Office with participation from researchers at Brown, Duke, and Johns Hopkins Universities. The problems of interest center around high-performance geometric computations. They include development of efficient methods for spatial databases and geographic information systems, especially those dealing with massive amounts of data. The candidate is expected to play a vital role in the development and/or use of the TPIE programming environment for external memory computation (http://www.cs.duke.edu/TPIE/). Issues involving memory hierarchies and parallel communication will also be considered. Additional responsibilities will be to interact with agency scientists and to help prepare contract, technical, and other reports. The candidate will interact closely with geometric computing groups at Brown, Johns Hopkins, and the Army Research Laboratories. Please send a letter of interest and your CV, and ask three evaluators to send letters of reference, by US Mail or email, to Mr. Keith Hurka-Owen Department of Computer Science Duke University Box 90129 Durham, NC 27708-0129 Email: hurka@cs.duke.edu Tel : (919) 660-6535 To be assured of full consideration, all material including reference letters must arrive by February 15, 1999. Applications will continue to be accepted until the position is filled. -- Jeffrey S. Vitter Email: jsv@cs.duke.edu Lehrman Professor and Chair Phone: (919) 660-6548 Department of Computer Science FAX: (919) 660-6502 Duke University, Box 90129 Home: (919) 382-8724 Durham, N.C. 27708-0129 Web: http://www.cs.duke.edu/~jsv/ Jusqu'? fin juin 1999: Jeffrey S. VITTER Projet PRISME Phone: +33 4.92.38.77.49 I.N.R.I.A. Sophia Antipolis Secr: +33 4.92.38.77.38 (Agn?s) 2004, route des Lucioles FAX: +33 4.92.38.76.43 B. P. 93 Email: Jeff.Vitter@sophia.inria.fr 06902 Sophia Antipolis Cedex Web: http://www.cs.duke.edu/~jsv/ FRANCE ------------- 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 From lgl at idirect.com Mon Feb 8 00:37:27 1999 From: lgl at idirect.com (LGL Limited) Date: Mon Jan 9 13:40:55 2006 Subject: B-Splines: computational formulae and interpolation Message-ID: <3.0.1.32.19990208003727.006c6a5c@idirect.com> Hello, I would like to calculate B-spline curves that fit a series of nodes along a polyline in the GIS I use. After calculating the curve I would like to be able to interpolate points along that curve at an approximate frequency of 10 new nodes to 1 old node. Optionally I would like to calculate these new nodes at set distances along the curve - perhaps calculated by intersecting a curve with the B-spline. Does anyone have an algorithm to do this without resorting to calculus - I would like some simple code to achieve this. Is this the correct list to ask such a question? Ideally I want to write a stand alone module in VisualBASIC to achieve this without having to resort to other numerical libraries. Thank you, Ted Elliott ------------- 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 From latin at fing.edu.uy Wed Feb 10 11:35:31 1999 From: latin at fing.edu.uy (LATIN 2000 - INCO) Date: Mon Jan 9 13:40:57 2006 Subject: First Call for Papers LATIN'2000 Message-ID: <199902101435.RAA23359@nana.fing.edu.uy> A non-text attachment was scrubbed... Name: not available Type: text Size: 4538 bytes Desc: not available Url : http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/19990210/fd93786b/attachment.bat From stolfi at dcc.unicamp.br Fri Feb 12 10:24:27 1999 From: stolfi at dcc.unicamp.br (Jorge Stolfi) Date: Mon Jan 9 13:40:57 2006 Subject: SIBGRAPI'99 First Call For Papers Message-ID: <199902121224.KAA19110@coruja.dcc.unicamp.br> F I R S T C A L L F O R P A P E R S = = = = = = = = = = = S I B G R A P I ' 9 9 = = = = = = = = = = = XII Brazilian Symposium on Computer Graphics and Image Processing University of Campinas, SP, Brazil - October 17--20, 1999 ----------------------------------------------------------- Image synthesis * Animation and simulation * Geometric modeling Computational geometry * Graphical interfaces * Scientific visualization Multimedia * Virtual reality * Image retrieval * Image segmentation Pattern recognition * Computer vision * Mathematical morphology Image compression * Three-dimensional images * Remote sensing Geographical databases * Graphics hardware * Applications -------------------------------------------------- http://www.dca.fee.unicamp.br/sibgrapi99/ THE CONFERENCE SIBGRAPI, a traditional yearly event of the Brazilian Computer Society, is the main technical congress for the country's computer graphics and image processing community. SIBGRAPI'99 will be the 12th issue of the conference, and the second one with international program committee and call for papers. The program will include presentation of TECHNICAL PAPERS, short COURSES, PANELS and WORKSHOPS, invited LECTURES, VIDEO and ART SHOWS, and a COMMERCIAL EXHIBITION. CALL FOR CONTRIBUTIONS The SIBGRAPI'99 Program Committee invites technical contributions in all areas of computer graphics and image processing, including (but not exclusively) the ones listed above, in the following categories: FULL PAPERS (up to 10 pages) and EXTENDED ABSTRACTS (2 pages), about original and unpublished developments on algorithms, techniques, hardware, or applications, related to the Symposium's themes. Submissions will be evaluated for relevance, originality, technical value, and conformity with the SIBGRAPI'99 style standards. Accepted items will be presented as technical lectures and published in the Proceedings. TECHNICAL POSTERS about projects still in progress. Submissions will be evaluated for their expected interest to the Symposium attendance, their potential to foster technical cooperation, and their overall quality. Accepted items will be exhibited in a Poster Session, and reduced copies will be made available to the participants. SHORT COURSES about classical or timely topics, at advanced or elementary level. Course proposals will be evaluated for relevance to the SIBGRAPI'99 themes, contents, originality, expected demand, and the lecturers' qualifications. Each course will consist of three to six hours of lectures, with printed notes (20-50 pages). WORKSHOPS and PANEL DISCUSSIONS, on topics related to the SIBGRAPI'99 themes, to be held together with the Symposium. Proposals to organize such events will be evaluated for relevance, expected attendance and value to the audience, and the proposers' qualifications. A description of each approved event (2 pages) will be printed in the SIBGRAPI'99 Proceedings. Detailed guidelines for preparing submissions in all these categories can be obtained at the addresses listed below. NOTE: Submissions that fail to follow those guidelines may be rejected, regardless of their merit. ORGANIZING COMMITTEE L?o Pini de Magalh?es (Unicamp), chair Pedro Jussieu de Rezende (Unicamp), co-chair Alexandre Xavier Falc?o (Unicamp) Ivan Luiz Marques Ricarte (Unicamp) Jos? M?rio De Martino (Unicamp) M?rcio Lobo Neto (USP) Neucimar Jer?nimo Leite (Unicamp) Roberto Alencar Lotufo (Unicamp) PROGRAM COMMITTEE (preliminary) Jorge Stolfi (Unicamp, BR), chair Cl?sio Luis Tozzi (Unicamp, BR), co-chair Antonio Oliveira (UFRJ, BR) Arnaldo Albuquerque (UFMG, BR) Brian Wyvill (U. Calgary, CA) Carla M. S. Freitas (UFRGS, BR) Gilles Bertrand (ESIEE, FR) Jo?o M. Carvalho (UFPB, BR) Jos? L. Encarna??o (IGD Darmstadt, DE) Junior Barrera (USP, BR) Luciano F. Costa (USP-SC, BR) Luiz H. de Figueiredo (LNCC, BR) Manuel Pr?spero dos Santos (UNL, PT) Nelson D. A. Mascarenhas (UFSCar, BR) Olga R. P. Bellon (UFPR, BR) Peter Eades (U. of Newcastle, AU) Paulo C?zar Carvalho (IMPA, BR) and Shin-Ting Wu (Unicamp), courses Gilbertto Prado (Unicamp, BR), art gallery Marcelo K. Zuffo (USP, BR), video show CONFERENCE LOCATION SIBGRAPI'99 will be held in the campus of the University of Campinas (Unicamp), one of Brazil's leading universities. Campinas is an agricultural and industrial town of 800,000 people, with a vigorous cultural life, including an acclaimed symphonic orchestra. The city is also a major technological center, being home to many research institutions and high-tech industries. Campinas is located about 100 km (a one-hour drive) Northwest of S?o Paulo, the largest city in South America and the third largest in the world. S?o Paulo is the economic capital of Brazil, and Rio's permanent rival in cultural and gastronomic matters. Campinas is connected to S?o Paulo and several Brazilian cities by regular air routes (including two or three daily flights to Rio), good highways, and numerous intercity buses. The visitor to Campinas will find plenty of opportunities for tourism starting from there. We will mention only that some 200km from Campinas are the forests and scenic views of the Serra do Mar, and the Atlantic coast with its warm waters and uncountable beaches. In the opposite direction, a day's drive away, is the huge Pantanal marshland with its rich and unique fauna. IMPORTANT DATES Papers and abstracts: submission deadline 22/Apr/99 decision due 21/Jun/99 final version due 09/Aug/99 Tutorials and Posters: submission deadline 22/Apr/99 decision due 21/Jun/99 final version due 09/Sep/99 Workshops and Panels: proposals deadline 05/Apr/99 decision due 03/May/99 final program due 09/Sep/99 ADDRESSES http://www.dca.fee.unicamp.br/sibgrapi99/ sibgrapi99@dca.fee.unicamp.br SIBGRAPI'99 DCA-FEEC-UNICAMP Caixa Postal 6101 13083-970 Campinas, SP - BRAZIL ------------- 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 From Martin.Erwig at FernUni-Hagen.de Mon Feb 15 10:56:05 1999 From: Martin.Erwig at FernUni-Hagen.de (Martin Erwig) Date: Mon Jan 9 13:40:57 2006 Subject: Intersection of 3D objects Message-ID: <199902150956.KAA19301@nansen.fernuni-hagen.de> Hi, I hope the following is not out of the scope of this mailing list. I am looking for algorithms and their complexities for the following two problems: (1) Intersection of two 3D volumes (2) Intersection of a 3D volume and a 3D line I have already looked into geombib (a VERY GOOD enterprise!), and some papers seem to be relevant, but before getting copies (some are quite difficult to obtain), I would like to know more precisely where I should look at. Some more details on the above two problems: (A) 3D volumes should be sets of (generally non-convex) polyhedra. (ie, volumes need not be connected). Volumes should be allowed to have holes. (If there are simpler algorithms for polyhedra without holes, this would also be interesting to know). (B) 3D lines are monotonic wrt the z-axis (ie, they can be viewed as functions the z-axis to the x-y-plane). Lines can be thought of as being given by a collection of straight line segments. Lines might consists of more than one component. (C) We can distinguish different topological relationships between two 3D objects: for volume/line it is possible that they are disjoint, that the line is inside the volume, or that the line runs along the border of the volume. The algorithm should ideally return an ordered sequence of z-intervals together with the information about the corresponding parts of the volume/of the region (each of which might be undefined), and of their topological relationship. (For each change in the topological relationship, a new interval should be reported. For topological relationships that hold only for one z-coordinate (here, intersection points) no (degenerated) interval has to be reported, since it can be derived from the other intervals.) For two volumes, we have five topological relationships: disjoint, externally tangent, overlap, internally tangent, and inside. I would appreciate any comments on this problem and, in particular, pointers to relevant papers. Thanks a lot, Martin ----------------------------------------------------------------------------- Dr. Martin Erwig Phone: +49 2331 987-4286 FernUniversitaet Hagen Fax: +49 2331 987-4278 Praktische Informatik IV Email: erwig@fernuni-hagen.de 58084 Hagen erwig@acm.org Germany URL: http://www.fernuni-hagen.de/inf/pi4/erwig/ ----------------------------------------------------------------------------- ------------- 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 From geomc at grec.ma2.upc.es Tue Feb 16 12:58:22 1999 From: geomc at grec.ma2.upc.es (Geometria computacional) Date: Mon Jan 9 13:40:57 2006 Subject: New geom.bib search page Message-ID: <9902161158.AA14828@grec.ma2.upc.es> The Computational Geometry Research Group of the Universitat Politecnica de Catalunya announces its GEOM.BIB SEARCH PAGE: http://www-ma2.upc.es/~geomc/geombibe.html It has been used for more than one year by the Spanish CG community, and seems to work pretty well. English, Catalan and Spanish are the language options. You are all welcome to use it! ------------- 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 From bern at parc.xerox.com Tue Feb 16 14:22:20 1999 From: bern at parc.xerox.com (Marshall Bern) Date: Mon Jan 9 13:40:57 2006 Subject: SoCG Acceptance List Message-ID: <99Feb16.142220pst."177475"@gratiano.parc.xerox.com> THEORETICAL TRACK: (27 papers) Approximation and exact algorithms for minimum-width annuli and shells Agarwal, Aronov, Har-Peled, Sharir Lower bounds for kinetic planar subdivisions Agarwal, Basch, de Berg, Guibas, Hershberger Motion planning of a ball amid polyhedral obstacles in three dimensions Agarwal and Sharir The path of a triangulation Aichholzer The table layout problem Anderson and Sobti Polytopes in arrangements Aronov and Dey Spanning trees crossing few barriers Asano, de Berg, Cheong, Guibas, Snoeyink, Tamaki Geometric algorithms for trap design Beretty, Goldberg, Overmars, van der Stappen Generalizing ham sandwich cuts to equitable subdivisions Bespamyatnikh, Kirkpatrick, Snoeyink Line and curve segment intersection with restricted predicates Boissonat, Snoeyink Hierarchical vertical decompositions, ray shooting , and circular arc queries in simple polygons Cheng, Cheong, Everett, van Oostrum Sliver exudation Cheng, Dey, Edelsbrunner, Facello, Teng Folding flat silhouettes and wrapping polyhedral packages: new results in computational origami Demaine, Demaine, Mitchell Curve reconstruction: connecting dots with good reason Dey, Mehlhorn, Ramos Edgewise subdivision of a simplex Edelsbrunner, Grayson The complexity of the union of (alpha, beta)-covered objects Efrat On minimum stars, minimum Steiner stars, and maximum matchings Fekete and Meijer Curve reconstruction, the TSP, and Menger's theorem on length Giesen Kinetic connectivity of rectangles Hershberger, Suri On bisectors for different distance functions Icking, Klein, Ma, Nickel, Weibler Visibility-based pursuit-evasion in a polygonal room with a door Lee, Shin, Chwa New bounds on crossing number Pach, Spencer, Toth On range reporting, ray shooting, and k-level construction Ramos Small distortion and volume preserving embedding Rao Sharp bounds on geometric permutation of pairwise disjoint balls Smorodinsky, Mitchell, Sharir Strechability of star-like pseudo-visibility graphs Streinu Efficient algorithms for maximum regression depth van Kreveld, Mitchell, Rousseeuw, Sharir, Snoeyink, Speckmann APPLIED TRACK (17 papers) Error-Bounded Regular Algebraic Spline Curves Bajaj and Xu Exact Geometric Computation Made Easy Burnikel, Fleischer, Mehlhorn, Schirra Determining an Optimal Penetration among Weighted Regions in Two and Three Dimensions Chen, Daescu, Hu, Wu and Xu On Deletion in Delaunay Triangulations Devillers Topological Beam Tracing, Fortune Geometric Pattern Matching: A Performance Study Gavrilov, Indyk, Motwani and Venkatasubramanian Crust and Anti-Crust: A One-Step Boundary and Skeleton Extraction Algorithm Gold H-Walk: Hierarchical Distance Computation for Moving Convex Bodies, Guibas, Hsu and Zhang Interval Methods for Kinetic Simulations Guibas and Karavelas A Core Library for Robust Numeric and Geometric Computation Karamcheti, Pechtchanski and Yap MAPC: A library for Efficient and Exact Manipulation of Algebraic Points and Curves Keyser, Culver, Manocha and Krishnan One-sided Smoothing of Polygons Lutterkort and Peters: A Geometric Approach to Computing Higher-Order Form Factors Pellegrini Controlled Perturbation for Arrangements of Polyhedral Surfaces with Application to Swept Volumes Raab Computing Roundness is Easy if the Set is Almost Round Ramos Empirical Design of Geometric Algorithms Weihe, Brandes, Liebers, Muller-Hannemann, Wagner and Willhalm Motion Planning for a Rigid Body Using Random Networks on the Medial Axis of the Free Space Wilmarth, Amato and Stiller ------------- 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 From dickijk at engga.uwo.ca Fri Feb 19 08:55:34 1999 From: dickijk at engga.uwo.ca (John Dickinson) Date: Mon Jan 9 13:40:57 2006 Subject: What are the best conferences for Computational Geometry? Message-ID: Dear All, What are the best conferences for Computational Geometry? Web addresses for info for attendees welcome. I am particularly interested in ones that have some focus on solid modelling and associated issues. John -- -((Insert standard disclaimer here))-|--- Washington Irving (1783-1859) ---- John Kenneth Dickinson | "A sharp tongue is the only Grad. Student Mech. Eng. U.W.O. | edge tool that grows keener email: jkdickin@julian.uwo.ca | with constant use." http://publish.uwo.ca/~jkdickin/ | ------------- 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 From jsbm at ams.sunysb.edu Mon Feb 22 08:30:26 1999 From: jsbm at ams.sunysb.edu (Joseph Mitchell) Date: Mon Jan 9 13:40:57 2006 Subject: conferences Message-ID: <199902221330.IAA12594@polya> Dear John, Please refer to my website, http://www.ams.sunysb.edu/~jsbm/events.html where I try to keep an up-to-date list of links of interest to computational geometers (including theory and applications areas, like graphics, solid modelling, GIS, etc). Additions are always welcome! The main conferences in CG include the annual ACM SoCG and the Canadian conference (CCCG); there are also a variety of workshops, including the European workshop, and the annual fall workshop series (originally at Stony Brook (91-95), and lately hosted by CGC sites (96-98)). CGers also like to publish in some "algorithms" conferences, such as SODA, WADS/SWAT, and ISAAC, as well as the traditional theory conferences (FOCS and STOC). Each application area has its own events too.... ACM Solid Modelling, SIGGRAPH, Eurographics, I3DG, Visualization, WAFR, ICRA, etc. Good luck! Joe ------------- 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 From kychwa at jupiter.kaist.ac.kr Mon Feb 22 16:41:33 1999 From: kychwa at jupiter.kaist.ac.kr (Chwa Kyung-Yong) Date: Mon Jan 9 13:40:57 2006 Subject: Distinguished Visiting Faculty Position from KAIST Message-ID: <19990222164133.A5687@jupiter.kaist.ac.kr> DISTINGUISHED VISITING FACULTY POSITION The computer science department at Korea Advanced Institute of Science and Technology (KAIST) invites applications for a faculty appointment in the general area of computer science, particularly in, but not restricted to theoretical computer science. We are seeking a researcher and teacher of great distinction whose work has been internationally acclaimed. Initial duties for the position will be teaching both undergraduate and graduate students for about 3 hours/week in every semester and advising the department chairman. In addition, he or she will plan and conduct independent or joint research programs. Salary will depend on qualifications and experience, but will be around US$120,000/year. Information about KAIST can be found on the Web page at: . Application should be sent with a curriculum vitae to : Faculty Search Committee Department of Computer Science KAIST, 373-1 Kusong-dong, Yusong, Taejon, Korea 305-701 Fax: +82-42-869-3510 e-mail: fsc@jupiter.kaist.ac.kr ------------- 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 From dehne at scs.carleton.ca Mon Feb 22 18:25:41 1999 From: dehne at scs.carleton.ca (Frank Dehne) Date: Mon Jan 9 13:40:57 2006 Subject: WADS'99 Message-ID: <199902222325.SAA22212@leo.scs.carleton.ca> A non-text attachment was scrubbed... Name: not available Type: text Size: 2784 bytes Desc: not available Url : http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/19990222/fbc7fe73/attachment.bat From Jeff.Vitter at sophia.inria.fr Thu Feb 25 09:00:59 1999 From: Jeff.Vitter at sophia.inria.fr (Jeff Vitter) Date: Mon Jan 9 13:40:57 2006 Subject: External Memory Algorithms and Data Structures Message-ID: <14037.782.684747.567860@gemma.inria.fr> My updated survey "External Memory Algorithms and Data Structures" is now available on the web. It will appear as one of the chapters in the book on External Memory Algorithms, co-edited with James Abello and published by AMS in the DIMACS series in Discrete Mathematics and Theoretical Computer Science. The survey article is available at either of the following two URLs: http://www.cs.duke.edu/~jsv/Papers/Vit98.IO_survey.ps.gz. http://www.cs.duke.edu/~jsv/Papers/Vit98.IO_survey.pdf If you got an earlier message recently, I apologize for the bother. The article was just finalized yesterday, so the version I mentioned earlier has been modified. If you've already downloaded it, you may want to re-download it. I'm currently putting together a joint manuscript with Lars Arge on the subject of external memory algorithms and data structures, which we hope to have done in a year, so more later! -- Jeff -- Jeffrey S. Vitter Lehrman Professor and Chair Email: jsv@cs.duke.edu Department of Computer Science Phone: (919) 660-6548 Duke University, Box 90129 FAX: (919) 660-6502 Durham, N.C. 27708-0129 Web: http://www.cs.duke.edu/~jsv/ Jusqu'? fin juin 1999: Jeffrey S. VITTER Projet PRISME Phone: +33 4.92.38.77.49 I.N.R.I.A. Sophia Antipolis Secr: +33 4.92.38.77.38 (Agn?s) 2004, route des Lucioles FAX: +33 4.92.38.76.43 B. P. 93 Email: Jeff.Vitter@sophia.inria.fr 06902 Sophia Antipolis Cedex Web: http://www.cs.duke.edu/~jsv/ FRANCE ------------- 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 From erdos99 at math-inst.hu Thu Feb 25 14:42:58 1999 From: erdos99 at math-inst.hu (Conference in memory of Paul Erdos'99) Date: Mon Jan 9 13:40:57 2006 Subject: No subject Message-ID: <199902251342.OAA16694@hexagon.math-inst.hu> Second Announcement Paul Erdos and his Mathematics Budapest, July 4-11, 1999 The Hungarian Academy of Sciences, the Janos Bolyai Mathematical Society, The Eotvos Lorand University of Budapest and The Mathematical Institute of The Hungarian Academy of Sciences, organize a conference dedicated to the memory of Paul Erdos which will be held July 4 - 11, 1999, in Budapest, Hungary. The topics of the conference include the basic fields to which Paul Erdos contributed: Analysis (including Ergodic Theory), Combinatorics (including Combinatorial Algebra, Combinatorial Geometry and Theoretical Computer Science), Number Theory, Probability Theory, and Set Theory among others. Scientific Program The program will include the following types of lectures and presentations. Plenary lectures: These will be expository lectures on particular areas of Paul Erdos' work. We emphasize that these talks will be addressed to a broad mathematical audience. Their aim is to put the theorems and conjectures of Paul Erdos in a historical context. The plenary speakers will be N. Alon (Israel), B. Bollobas (USA, England), P. Borwein (Canada), P. D.T.A. Elliott (USA), R. L. Graham (USA), A. Hajnal (Hungary, USA), P. Komjath (Hungary), D. S. Lubinsky (South Africa), C. Pomerance (USA), I. Z. Ruzsa (Hungary), M. Simonovits (Hungary) and J. Spencer (USA). Parallel sessions: There will be five parallel sessions in the fields listed above consisting of invited lectures of 30 minutes duration each. The emphasis will be on the influence of Paul Erdos' work. We had to put a limit on the number of lectures, but we gladly offer participants the opportunity to contribute to the poster session, the volume of short communications or to mini workshops described below. Poster Session: All participants may present their work in scheduled poster sessions provided they submit an abstract by March 31, 1999. A LaTeX template for posters may be obtained from the conference's homepage: http://www.math-inst.hu/~erdos99 Volume of Short Communications: All participants are invited to submit an extended abstract [maximum: 3 pages] that is expected to be related to the mathematics of Paul Erdos. These will be refereed and the volume will be distributed at the beginning of the conference. The deadline for submitting the extended abstracts is also March 31, 1999. Mini-Workshops: For small groups that wish to get together for specialized discussions we shall be happy to arrange the appropriate facilities. Conference volumes The Volume of Short Communications (invited and contributed, as well) will be distributed at the conference and its price is included in the registration fee. We will publish the invited papers in two different ways. The papers containing mainly new results in Combinatorics and related areas will appear in a special issue of Combinatorica. We do not plan to publish research papers in other areas, e.g. Analysis, Analytic Number Theory, Set Theory. On the other hand, survey type papers of the invited speakers (in any area of the conference) will be collected in one or more volumes of the Bolyai Society Mathematical Studies (published by the Janos Bolyai Mathematical Society). This series started with the volumes "Erdos is 80 I, II" and has already reached 10 volumes. The program starts as follows: 4 July, Sunday 14.00 - 18.00 Registration 18.30 - 20.00 Welcome Party 5 July, Monday 9.00 - 10.00 Opening session 10.30 - 13.00 Plenary sessions Technical Equipment Overhead projectors, tape recorders and video equipment will be provided. Please indicate extra needs on your Registration Form. We greatfully acknowledge the support of the following sponsors: -Arany Janos Foundation -DIMACS -DIMANET-PECO -DIMATIA -European Mathematical Union (EMU) -Foundation for the Modernization of Hungarian Education (KOMA) -Hungarian Academy of Sciences -Hungarian National Committee for Technical Development (OMFB) -Hungarian National Foundation for Scientific Research (OTKA) -International Mathematical Union (IMU) -Number Theory Foundation -Pazmany-Eotvos Foundation (ELTE) -Soros Foundation Registration and Accommodation Registration fee: $160 if paid in full by April 1st, $250 afterwards. Registration fee for accompanying persons is $80 until April 1st, $100 afterwards. The registration fee includes - Admission to scientific sessions - Conference Program, Volume of Short Communications and Abstracts - Welcome Party - Refreshments - Banquet - Conference Excursion The registration fee for accompanying persons includes -Welcome party -Banquet -Conference Excursion There is a possibility to buy additional tickets for the Welcome Party, the Banquet and the Excursion, separately. Accommodation Hotel accommodation can be reserved at rates listed on the enclosed Hotel Reservation Form. Please complete and return this form together with your hotel deposit not later than 1 April, 1999. A deposit of one (1) night will be required to secure your hotel reservation. For methods of payment see below. The Organizing Secretariat reserves the right to book you into a similar hotel should the requested hotel be fully booked. A written confirmation will be sent to you after receiving your deposit. The outstanding balance should be paid directly at the registration desk. Advance payment for registration and hotel can be made by credit card, bank transfer or certified/cashier check (unfortunately not by personal check). By credit card Please give the card number, card type (e.g. Visa, Mastercard, etc.) and the expiration date. By bank transfer Bank name: Hungarian Foreign Trade Bank Ltd. Bank address: 1051 Budapest, Szent Istvan ter 11. Hungary Swift code: MKKBHUHB Account number for participants: MTA "Tudomany" 501-00047-2100-4019 PEM'99 The name of the participant should be clearly stated on the bank payment. Please note that the Organizing Secretariat will not accept bank charges; bank charges are at the sender's expense. By certified/guaranteed payment cheque The cheque, which should state the participant's name clearly, should be enclosed with the completed Registration Form and made payable to: PEM '99, Office for International Cooperation, HAS, 1051 Budapest, Nador u. 7., Hungary. Personal or company cheques cannot be accepted. During the Congress major credit cards will be accepted at the Registration Desk. Cancellation and refunds Cancellation of the participation and hotel reservation can only be made in writing to the Organizing Secretariat. Full refunds of the registration fee will be made before 31 May, 1999, while 80% can be refunded between 31 May and 15 June, 1999. No refunds will be made after 15 June. Unfortunately, we cannot return hotel deposits in case of cancellation. You are kindly asked to return, via ordinary mail, fax, or e-mail (to: khajos@office.mta.hu), the enclosed Registration and Hotel Reservation Forms together with a copy of the bank transfer document (registration fee + one night hotel deposit) to the Organizing Secretariat not later than 1 April, 1999. These forms can also be downloaded from http://www.math-inst.hu/~erdos99 in PostScript, MSWord, LaTeX or ASCII text format. If you send your registration via e-mail, please use the ASCII TEXT FORMAT ONLY. Deadlines - all deadlines are as "postmarked by" March 31st, 1999 - deadline for the submission of Abstracts May 15, 1999 - confirmation of the acceptance of Abstracts by the Selection Committee April 1, 1999 - registration with $160 registration fee April 1, 1999 - hotel reservation. After April 1st we cannot guarantee the availability of hotel rooms of chosen comfort level. (We have deadlines towards the hotels.) GENERAL INFORMATION Conference site: Hungarian Academy of Sciences 1051 Budapest Roosevelt ter 9. Transfer from the airport to the city The city can be easily reached by Airport Minibus Service. These minibuses are comfortable and they take you to any address in the city from Airport Terminals 1 and 2. Price per person is HUF 1.500 (approximately 6-8 USD). This door-to-door minibus service is much more reasonably priced than taxis. Local Transportation in Budapest Buses, trams and the metro (subway) run without conductors. Tickets must be purchased in advance at your hotel or at metro stations. Each ticket (except daily and weekly tickets) is valid for one ride only and must be punched on the bus, tram or trolley-bus or stamped at the entrance to the metro. The cost of a one-way ticket is HUF 90. It is suggested to buy a weekly ticket, which costs about 1700 HUF. There are also daily tickets available, and cheaper tickets for short travels on metro. Passport and Visa Visitors to Hungary must possess a valid passport. Entry visas are not required for citizens of most European countries, USA, Canada, South Africa, Israel and Mexico. Entry visas are required for citizens of Australia, Brazil, Cambodia, China, Columbia, Egypt, India, Iran, Libya, Marocco, New Zeland, North-Korea, Pakistan, Phillippines, Syria, Taiwan, Thailand, Turkey, Venezuela, Yemen, among others. You are kindly requested to inquire at the Hungarian Embassy or Consulate in your country. Currency, Exchange, Credit cards The official currency in Hungary is the Hungarian Forint (HUF), the exchange rate is 1 USD = 225 HUF (February 1999). Foreign currency can be brought into Hungary without restrictions. Currency exchange is available at the airport, at major banks and hotels. Banking hours in the city are 09.00 - 14.00, Monday to Friday. Automatic teller machines are available throughout the city and accept most major credit and bank cards (MAC, CIRRUS, PLUS, etc.). Cheques and major credit cards are accepted in hotels, larger restaurants, some department stores and shops but you should ask before ordering a service. There is no money exchange at the conference registration desk. Weather and Clothing The climate in Hungary in July is usually sunny with an average daily temperature of 25 C (77 Fahrenheit). Showers may occur but normally humidity is not high. However, it is not totally unlikely that temperatures may stay only in the teens. Informal dress is appropriate for all events. Electricity supply In Hungary electricity is supplied at 220 V, 50 Hz. The 2-pin plug is different from the one used in some other countries, but same as in for example Germany. Letter of Invitation Upon request the Organizing Secretariat will issue personal invitations to those wishing to participate in the congress. It should be understood that the exclusive purpose of such invitations is to assist participants in obtaining funds or visas. It is not a commitment of the Organizing Committee to provide any financial support. Budapest, the Host City The twin cities of Buda and Pest are situated opposite each other on the banks of the Danube. Buda, on the right bank is the more ancient of the two, going back in her origins to Roman times and beyond. The baroque Royal Palace - looking down to the plain where the city of Pest sprawls - is the fourth or fifth regal habitat on the hill. Pest, the more modern, is the home of the country's political life and the seat of government. There, in the heart of the administration district, stands the magnificent neo-gothic building of the Houses of Parliament and just a couple of blocks away the central building of the Hungarian Academy of Sciences, next to the oldest bridge of the city. Pest, which stretches to the East and to the South, is also the center of business, banking and industry of the country. Do not miss the busy shopping street of "Vaci utca" with its elegant shops and cafes. Hilly Buda, with her famous museums on Castle Hill and the winding medieval streets of the old "burgher town", offering romantic walks and enchanting views of bustling Pest, is also renowned for the traditional Hungarian cuisine to be tasted in some of the country's finest restaurants. Another famous feature of Budapest are its thermal baths. They were introduced by the Turks in the 16th century. There are nice swimming pools, as well, so don't forget your swimming suit at home! Scientific correspondence should be addressed to the organizing committee: V.T. Sos (Committee Chair), A. Sali (secretary), L. Babai, B. Bollobas, A. Hajnal, G.O.H. Katona, M. Laczkovich, L. Lovasz, P. Revesz, A. Sarkozy, M. Simonovits, J. Szabados. URL: http://www.math-inst.hu/~erdos99 e-mail: erdos99@math-inst.hu fax: (+36-1-)317-7166 Renyi Mathematical Institute of HAS Budapest P.O.B. 127 H-1364 Hungary All other correspondence, including registration, hotel reservation, etc should be addressed to the Organazing Secretariat: Ms Katalin Hajos Office for International Cooperation Hungarian Academy of Sciences Budapest, Nador u.7. H-1051 Hungary tel/fax: (+36-1-)317-2840 e-mail: khajos@office.mta.hu ________________________________________________________________ HOTEL RESERVATION FORM Paul Erd?s and his Mathematics July 4- 11, 1999 Budapest, Hungary ____________________________________________________________ NAME:...................................................................... Ms /Mr Family Name First Name(s) PHONE: country code:.... area code:.... number:......................... FAX : country code: ....area code: ....number:......................... E-MAIL:......................................................... Please tick where appropriate: ____Single ____Double Date of arrival: .../ 07 /99 Date of departure: .../07 /99 Number of nights in hotel: .. Name of person(s) sharing room:................................. .............................................. Hotel deposit paid: ............................................ Method of payment:.............................................. Remarks:........................................................ ................................................................ Please tick at the required hotel category : HOTEL single room double room USD/night USD/ night * * * * * ____ Intercontinental, Hyatt 150 180 * * * * ____ Mercure, Hungaria, Helia 110 140 * * * ____ Orion, Bara, Griff 80 100 * * ____ Hill, Bolyai 40 50 * ____ Student hostel 20 30 Hotel rooms are to be reserved by sending a deposit for one night before April 15, 1999. Please note that reservations will be confirmed only after receipt of your hotel deposit. Hotel room rates are per night and include breakfast and all taxes. Final payments can be made by bank transfer or at the Registration Desk. Additional charges (e.g. mini-bar, laundry, telephone calls etc.) are to be paid to the hotel upon check-out. Date:____________________ Signature:______________________________________________________ ________________________________________________________________ Please complete and sign this form and send along with the proof of payments before April 15, 1999 to the Office for International Cooperation of the Hungarian Academy of Sciences H-1051 Budapest, Nador u.7. Tel: + 36 (1) 317 6215 Fax: + 36 (1) 317 2840 or 317 6215 ________________________________________________________________ REGISTRATION FORM Paul Erd?s and His Mathematics July 4-11, 1999 Budapest, Hungary ____________________________________________________________ Please print or type NAME:........................................................... Ms /Mr Family Name (for badge) First Name(s) COUNTRY:........................................................ COMPANY/ORGANIZATION:........................................... ................................................................ ................................................................ MAILING ADDRESS: ............................................... Street Address ............................................... City Country with postal code:....................................... PHONE: country code:.....area code:....No:...................... FAX: country code:.....area code:....No:.................... E-MAIL: ........................................................ ACCOMPANYING PERSON(S): ........................................ ................................................................ ................................................................ I enclose the following proof of payment : Registration fee:............................................USD Accompanying person's registration fee:......................USD Hotel deposit................................................USD _____________________USD (Please note that all fees must be paid in USD.) Credit Card: ____Visa ____MasterCard ____Other:________________ Card Number:___________________________________ Expiration Date:______________________________ Date: Signature:_________________________________ ____________________________________________________________________ Please complete and sign this form and send along with the proof of payments before April 15, 1999 to the Office for International Cooperation of the Hungarian Academy of Sciences H-1051 Budapest, Nador u.7. Tel: + 36 (1) 317 6215 Fax: + 36 (1) 317 2840 or 317 6215  ------------- 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 From dickijk at engga.uwo.ca Fri Feb 26 11:21:40 1999 From: dickijk at engga.uwo.ca (John Dickinson) Date: Mon Jan 9 13:40:57 2006 Subject: Thanks. Message-ID: I just wanted to say thank you very much to everyone who sent me email regarding my request ofr information on Solid Modelling conferences. I recieved too many answers to reply to individually. John -- -((Insert standard disclaimer here))-|--- Washington Irving (1783-1859) ---- John Kenneth Dickinson | "A sharp tongue is the only Grad. Student Mech. Eng. U.W.O. | edge tool that grows keener email: jkdickin@julian.uwo.ca | with constant use." http://publish.uwo.ca/~jkdickin/ | ------------- 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