From Michael.Aupetit at site-eerie.ema.fr Thu Jul 1 13:10:24 1999 From: Michael.Aupetit at site-eerie.ema.fr (Aupetit Mickael) Date: Mon Jan 9 13:40:57 2006 Subject: Some questions about interpolation... Message-ID: <199907011010.MAA12771@jessica.eerie.fr> Hello, my name is Michael Aupetit, I'm a PhD student in the field of Artificial Neural Networks. I'm very interested by interpolation technics. I've heard about "natural Neighbours"; "NURBS" and some other technics, but I fear these technics are not able to deal with high dimensional input spaces (as we found in ANNs) with reasonable time consuming and complexity of operations (e.g. for example,how to calculate vector product used in Natural Neighbour Interpolation, while the dimension of vectors is higher than 3?). So, I have three questions: Hypothesis: I have the p-dimensional Delaunay triangulation of n data points. And I know the Jacobian (gradient) and possibly the Hessian (curvature) in each data point. 1) Does it exist any interpolation method able to deal with high dimension (at least more than 5) that is C1 or C2 where ever? Could you send me references? 2) What is the complexity of existing interpolation technics according to n (the number of data points that support the interpolation) and p (the dimension of the input space) or other parameters? 3) Does it exist "standard" tests to establish that an interpolation method is "good" or "bad"? (e.g. for example, we could imagine an interpolation method able to pass through all data points with a 1st order continuity where ever, but with a not desired behavior between data points, as "holly" or "gap" between them even if they are theoretically in the same plan according to their respective Jacobian...) Thank you for your help Sorry if I've already contacted you by another way. Michael Aupetit ______________________________________ | Michael AUPETIT | | LGI2P - EMA - Site EERIE | | Parc Scientifique G.BESSE | | 30000 Nimes | | FRANCE | | | | Ph.D (1st year) student | | Department of Neural Network | | and Self-organization | | | | Phone: (033) 04.66.04.16.84 | | Fax: (033) 04.66.38.70.74 | | E-mail: aupetit@site-eerie.ema.fr | |______________________________________| ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From Paul.Heckbert at HOSTESS.GRAPHICS.CS.CMU.EDU Thu Jul 1 12:12:32 1999 From: Paul.Heckbert at HOSTESS.GRAPHICS.CS.CMU.EDU (Paul.Heckbert@HOSTESS.GRAPHICS.CS.CMU.EDU) Date: Mon Jan 9 13:40:57 2006 Subject: Some questions about interpolation... Message-ID: <199907012234.BAA11900@post.tau.ac.il> Michael Aupetit asked: > Does it exist "standard" tests to establish that an interpolation > method is "good" or "bad"? > > Does it exist any interpolation method able to deal with high > dimension (at least more than 5) You probably want some metric of smoothness or fairness for a function. The most common metric, for univariate functions, is the integral of the square of the second derivative. The interpolating function minimizing this is the "natural cubic spline", whose solution reduces to a tridiagonal system of equations. The metric can be generalized in various ways for multivariate functions. In general, I don't believe the optimal solution in higher dimensions has a closed form solution, but you can use numerical variational techniques, including multigrid or wavelets, to find an approximate solution efficiently. For references, search for "variational surface" at http://www.cs.cmu.edu/~ph/859E/www/project.html and see the work cited there by Terzopoulos and Kobbelt. Paul Heckbert, Associate Professor Computer Science Dept., Carnegie Mellon University 5000 Forbes Ave, Pittsburgh PA 15213-3891, USA ph@cs.cmu.edu http://www.cs.cmu.edu/~ph ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From brd at cs.dartmouth.edu Fri Jul 2 14:30:49 1999 From: brd at cs.dartmouth.edu (Bruce Randall Donald) Date: Mon Jan 9 13:40:57 2006 Subject: WAFR 2000 CALL FOR PAPERS Message-ID: <199907021730.NAA14262@cs.dartmouth.edu> WAFR 2000 CALL FOR PAPERS The Fourth International Workshop on the Algorithmic Foundations of Robotics March 16-18 2000 Dartmouth Hanover, New Hampshire http://www.cs.dartmouth.edu/~wafr Robot algorithms are abstractions of computational processes that control or reason about motion and perception in the physical world. The computation may be implemented in software, hard-wired electronics, biomolecular mechanisms, or purely mechanical devices. Because actions in the physical world are subject to physical laws and geometric constraints, the design and analysis of robot algorithms raises a unique combination of questions in control theory, computational and differential geometry, and computer science. Algorithms serve as a unifying theme in the multi-disciplinary field of robotics. WAFR aims at bringing together a group of about sixty researchers to discuss recent trends and important future directions of research on the algorithmic foundations of robotics. The workshop consists of invited talks by key researchers in the field and twenty contributed presentations in a single track. The proceedings will be published in a hard-cover volume. Topics of interest include, but are not limited to, * geometric algorithms * minimalist and underactuated robotics * manufacturing and assembly * holonomic and nonholonomic motion planning * manipulation planning * sensor-based planning * controllability, complexity, and completeness * task-level planning * grasping and fixturing * physically realistic simulation * navigation * computational biology * modular and reconfigurable robots * distributed manipulation VENUE Participants will stay at the historic Hanover Inn on the Appalachian Trail, near the White Mountains of New Hampshire. The workshop will take place on the Dartmouth campus. PAPER SUBMISSION Authors are invited to submit four (4) copies of a full paper by December 1, 1999 to Prof. Kevin Lynch Mechanical Engineering Department Northwestern University 2145 Sheridan Road Evanston, IL 60208 Authors will be notified of the disposition of their papers by January 20, 2000. Camera-ready copies of the papers are due by February 20. These will be distributed to the workshop participants. Final versions of the papers for publication are due after the workshop. GENERAL CHAIRS Bruce Donald, Dartmouth Kevin Lynch, Northwestern Daniela Rus, Dartmouth PROGRAM COMMITTEE Pankaj Agarwal, Duke Srinivas Akella, UIUC Nancy Amato, Texas A&M Antonio Bicchi, U. Pisa Bruce Donald, Dartmouth Kamal Kant Gupta, Simon Frasier Leslie Kaelbling, Brown Makoto Kaneko, U. Hiroshima David Kriegman, UIUC Steve LaValle, Iowa State Kevin Lynch, Northwestern Dinesh Manocha, UNC Jim Ostrowski, U. Pennsylvania John Reif, Duke Daniela Rus, Dartmouth Elisha Sacks, Purdue ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From lin at cs.unc.edu Sun Jul 4 00:05:18 1999 From: lin at cs.unc.edu (Ming Lin) Date: Mon Jan 9 13:40:57 2006 Subject: PQP release Message-ID: <199907040305.XAA03597@geom.cs.unc.edu> PQP: Proximity Query Package We announce the release of a new proximity query package called PQP. It is a library for performing three types of proximity queries on a pair of geometric models composed of triangles. They are: 1. Collision detection - detecting whether the two models overlap, and optionally, all of the triangles that overlap. 2. Separation distance computation - computing the minimum distance between a pair of models, i.e., the distance between the closest pair of points. 3. Tolerance verification and approximate distance queries - determining whether two models are closer or farther than a tolerance distance. It uses OBBs for collision detection and family of swept sphere volumes for distance computation and tolerance verification. It has been successfully applied to virtual prototyping, dynamic simulation, path planning and other applications. It is applicable to all triangulated polygonal models, including polygon soups. It is free for non-commercial use. More information about the package, new proximity query algorithms, MPEG demonstrations and related publications can be found at: http://www.cs.unc.edu/~geom/SSV ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From qw_people at dia.uniroma3.it Sat Jul 3 10:49:31 1999 From: qw_people at dia.uniroma3.it (The QueryViewer Team) Date: Mon Jan 9 13:40:57 2006 Subject: QueryViewer: A Java System for drawing the result of a Query Message-ID: <377DC08A.2BB29645@dia.uniroma3.it> QUERY VIEWER Beta Version for Windows 95/98/NT QueryViewer is a system designed to display the data contained into a database by means of graphical representations. You can open your database with QueryViewer, you can execute queries on the tables and then you can obtain a graph-like representation of the results of the query. CAPABILITIES QueryViewer gives you a following features: - Exploring a MS Access database - Writing and executing a query on a database - Selecting a subset of the table's field as interesting fields for the analysis - Selecting a model for drawing the binary relation among selected fields with a graphical representation - Manipulating the obtained graph with several graphical functions - Saving and loading the obtained result for the future reuse DOWNLOAD QueryViewer may be downloaded from the site: http://www.dia.uniroma3.it/~lenti/QueryViewer Enjoy QueryViewer, The QueryViewer Team ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From sjungic at cs.sfu.ca Thu Jul 8 14:24:55 1999 From: sjungic at cs.sfu.ca (Sadika Jungic) Date: Mon Jan 9 13:40:57 2006 Subject: Workshop on Algorithms and Data Structure - WADS'99 Message-ID: <199907082024.NAA06320@giansar.cs.sfu.ca> Dear potential participant, Here is our reminder about the Subject: 1999 Workshop on Algorithms And Data Structures (WADS'99) August 11 - August 14, 1999 Harbour Center, Simon Fraser University, Vancouver, BC, Canada Sponsored by The Pacific Institute for Mathematical Sciences. Organizing Comm.: B. Bhattacharya, A. Gupta, A. Liestman, T. Shermer e-mail: wads@cs.sfu.ca Conference Information: http://www.pims.math.ca/sections/activities/wads99.html Conference Program: http://www.pims.math.ca/wads99/programme.html Registration: http://www.pims.math.ca/wads99/register.html REGISTER NOW! EARLY REGISTRATION DEADLINE: July 9 ---------------------------------------------------------- Please do not hesitate to contact me if there is anything about the Workshop that I can help you with. Regards. -- Sadika Jungic Administrative Assistant for PIMS/MITACS Simon Fraser University 8888 University Drive Burnaby, B.C. V5A 1S6 Tel: (604) 291-5808 Fax: (604) 291-4947 ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From tokuta at math.jmu.edu Thu Jul 8 17:29:27 1999 From: tokuta at math.jmu.edu (Alade Tokuta) Date: Mon Jan 9 13:40:57 2006 Subject: North Cartolina Central University Faculty Positions Message-ID: NORTH CAROLINA CENTRAL UNIVERSITY DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE The Department of Mathematics and Computer Science at North Carolina Central University invites applications for two Assistant Professor position (tenure-track) for the 1999-2000 academic year. We seek applicants able to teach introductory and core courses in computer science and mathematics. Salary is competitive. We encourage applicants with research interests that align with those of the department. QUALIFICATIONS: Ph.D. in computer science with strong preparation in mathematics (preferred), minimum of three years experience teaching at the college/university level, scholarly research/publications. INSTRUCTIONAL DUTIES: Duties include teaching 12 hours per semester of Computer Science and Mathematics courses distributed among undergraduate and graduate level courses, academic and thesis advising, providing leadership in the development of a strong Computer Science curriculum, serving on departmental and University committees, recruitment of students and assistance in proposal writing. Teaching schedule will include evening assignments. Applicant materials should include vitae, cover letter, academic transcripts, names of three references to: Professor Alade Tokuta Chair, Department of Mathematics and Computer Science P.O. Box 19796 North Carolina Central University Durham, NC 27707 References should address both teaching and research ability. Inquiries may be directed to Professor Tokuta by email (tokuta@sci.nccu.edu) or phone (919-560-6315). Application deadline is July 15. The screening committee will begin screening of candidates by July 20, 1998. Applications will be accepted until the positions are filled. Anticipated staring date is August 13, 1999. Fall classes begin on August 17, 1999. ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From flores at siam.org Fri Jul 9 16:38:19 1999 From: flores at siam.org (flores@siam.org) Date: Mon Jan 9 13:40:57 2006 Subject: PLEASE POST Message-ID: <9907099315.AA931549100@venn.siam.org> SODA 2000 The DEADLINE for submission of 10-page abstracts is TUESDAY, July 13, 1999, no later than 5:00 PM EDT. Instructions and information about electronic submissions can be found at http://www.sigact.acm.org/~soda2ka/SODA2000.html The SODA 2000 Call for Papers can be found at www.siam.org/meetings/da00/ ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From rote at inf.fu-berlin.de Tue Jul 13 18:57:10 1999 From: rote at inf.fu-berlin.de (Guenter Rote) Date: Mon Jan 9 13:40:57 2006 Subject: Assistant position at FU Berlin References: <199802040835.JAA13500@blabla.inf.ethz.ch> Message-ID: <378B61D6.BF660127@inf.fu-berlin.de> At the Free University of Berlin, a position of Assistant Professor (Wiss. Assistent/in C1) is available at the department of Computer Science, starting October 1, 1999, for a duration of at most six years. Area: design and analysis of efficient algorithms, especially in computational geometry. Formal requirement: Ph.D. in computer science or mathematics The applicant should have research experience in the field of algorithms, combinatorial or computational geometry, discrete mathematics, or optimization. The position involves both research and teaching at an advanced level. A knowledge of German is not mandatory. It is possible to work towards a "Habilitation". Further information can be obtained on the Web at http://www.inf.fu-berlin.de/~rote/joboffer.html or by contacting Prof. Guenter Rote, rote@inf.fu-berlin.de, Freie Universitaet Berlin, Institut fuer Informatik, Takustrase 9, D-14195 Berlin, Germany, Tel. (49)30-838-75150, fax (49)30-838-75109 Applications citing the number "WA24" should be sent by August 10, 1999 to Freie Universitaet Berlin Fachbereich Mathematik und Informatik, Fachbereichsverwaltung, Arnimallee 2-6, D-14195 Berlin, Germany. ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From jlindy at eecs.tufts.edu Thu Jul 15 14:14:59 1999 From: jlindy at eecs.tufts.edu (Seg Fault) Date: Mon Jan 9 13:40:57 2006 Subject: in search of R.L. Ogniewicz Message-ID: I am in search of contact information for Robert L. Ogniewicz, who was a postdoc at the Harvard Robotics Laboratory. When contacted, HRL had no idea of his whereabouts or current email address. I have downloaded and am attempting to install his MAT-1.0.3 software for generating medial axes. Thanks, Jeff Lindy Tufts University Medford, MA, USA ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From oli at biba.uni-bremen.de Mon Jul 19 17:59:52 1999 From: oli at biba.uni-bremen.de (Antonio Torrealba Olivares) Date: Mon Jan 9 13:40:57 2006 Subject: Help for boolean operations Message-ID: <37933D68.D2515284@biba.uni-bremen.de> Hi all, for my diploma thesis I want to program boolean-operations for triangulated facet models used in Rapid Prototyping applications. Since such models often contains more than 100000 triangles, especially the fast performance of the algorithms is important. Does anyone know where I can find some good articles or literature for this "problem". Thanks in advance, Antonio ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From klara at CS.bgu.ac.il Thu Jul 15 00:16:42 1999 From: klara at CS.bgu.ac.il (klara kedem) Date: Mon Jan 9 13:40:57 2006 Subject: Euro-CG 2000 Call for papers Message-ID: <199907142016.XAA02277@cyan.cs.bgu.ac.il> ####################################################################### C A L L F O R P A P E R S 16TH EUROPEAN WORKSHOP ON COMPUTATIONAL GEOMETRY March 13-14-15 2000 Eilat Club Hotel, Eilat, Israel http://www.cs.bgu.ac.il/~cg2000 Sponsored by Ben-Gurion University of the Negev, Beer-Sheva, Israel ######################################################################## The European Workshop on Computational Geometry will be held in March 13-14-15 2000, at Eilat Club Hotel, Eilat, Israel. The European Workshop on Computational Geometry is an important scientific event in which established researchers from academia, R&D people from industry, and research students and postdocs meet and present their current work, establishing a scientific interaction and international collaboration. ------------------------------------------------------------------------ TOPICS: The topics of interest include but are not limited to: Analysis of geometric algorithms and data structures, theoretical issues arising from implementations, geometric optimization, analysis of geometric configurations And applications of computational geometry to robotics and virtual worlds, computer graphics, simulation and visualization, image processing, geometric and solid modeling, computer aided geometric design, manufacturing, geographical information systems, and structural molecular biology. ------------------------------------------------------------------------ SUBMISSIONS: A title and a brief abstract (2-4 pages) should be submitted (either PS files by email to cg2000@cs.bgu.ac.il or camera-ready papers by regular mail to the address below) before January 7th, 2000. The abstracts will be collected and distributed among the participants at the Workshop. Deadline for submissions : January 7th, 2000 A special issue of ``Computational Geometry: Theory and Applications'' will be dedicated to outstanding works presented at the workshop. ------------------------------------------------------------------------ FINANCIAL SUPPORT: The most important goal of the workshop is to allow as many young researchers -- European and Israeli PhD students and postdocs -- to participate and intellectually profit from the workshop. We are trying to get financial support to cover part of the travel from Europe to Israel, and perhaps some of the hotel expences. See below for deadline for support application. ------------------------------------------------------------------------ PROGRAM COMMITTEE: Gill Barequet, Technion Danny Halperin, Tel-Aviv University Matthew Katz, Ben-Gurion University Klara Kedem, Ben-Gurion University (chair) Micha Sharir, Tel-Aviv University Ayellet Tal, Technion ------------------------------------------------------------------------ ADDRESS: CG 2000 16th European Workshop on Computational Geometry Department of Mathematics and Computer Science Ben-Gurion University of the Negev P.O.Box 653 Beer-Sheva 84105 E-mail: cg2000@cs.bgu.ac.il Phones: (972)-7-6477869 and (972)-7-6461628 Fax: (972)-7-6472909 ------------------------------------------------------------------------ IMPORTANT DATES January 7th, 2000: Deadline for submissions January 15th, 2000: Program available from this web page January 25th, 2000: Last day of applying for support February 25th, 2000: Deadline for registrations March 13th, 2000: Beginning of the conference ------------------------------------------------------------------------ EILAT Eilat is a diving and snorkeling resort town, with wonderful beaches, food and atmosphere. The hotel is a new, large and luxurious five-star hotel, located in the North beach of Eilat. It is close to the town center and has many recreation facilities. PETRA If there is a large enough number of people interested in going to ancient Nabattian town, Petra, in the red mountains of Jordan, we will organize a one-day excursion on the day following the meeting. ######################################################################## ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. From subodh at blaze.cs.jhu.edu Wed Jul 14 21:48:18 1999 From: subodh at blaze.cs.jhu.edu (Subodh Kumar) Date: Mon Jan 9 13:40:57 2006 Subject: CGC'99: Call for participation Message-ID: <199907142048.UAA03448@chitra.cs.jhu.edu> Call for Papers 4th CGC Workshop on Computational Geometry Johns Hopkins University, Baltimore, MD, October 15-16, 1999 We are pleased to announce the fourth annual fall Workshop on Computational Geometry, sponsored by the Center for Geometric Computing, continuing a tradition established by the Mathematical Sciences Institute at SUNY-Stony Brook. The Center for Geometric Computing is a collaborative center of Brown, Duke, and Johns Hopkins Universities, and is funded by the U.S. Army Research Office. Scope and Format The aim of this workshop is to bring together researchers from academia, industry, and the Army to stimulate collaboration on problems of common interest arising in geometric computations. Topics to be covered include, but are not limited to: Algorithmic methods in geometry I/O-scalable geometric algorithms Animation of geometric algorithms Computer graphics Solid modeling Geographic information systems Computational metrology Graph drawing Experimental studies Geometric data structures Implementation issues Robustness Computer vision Robotics Computer-aided design Mesh generation Following the tradition of the previous MSI and CGC Workshops on Computational Geometry, the format of the workshop will be informal, extending over 2 days, with several breaks scheduled for discussions. Registration will be on-site, and will include the abstract booklet, coffee breaks, lunches, and a reception. There will be a registration fee of $75. Invited speakers To be Announced Submissions Authors are invited to submit abstracts for talks to be given at the workshop. Please send an abstract (up to 2 pages) and a draft of a paper (if you have one). E-mail submissions are encouraged; send to cgc@cs.jhu.edu. Ideally, the abstract should be a PDF, PostScript, or LaTeX, file, for ease in assembling the abstract booklet. Abstracts can also be sent by regular mail to: Subodh Kumar Department of Computer Science Johns Hopkins University 224 NEB, 3400 N. Charles St. Baltimore, MD 21218 Submissions should arrive by September 10, 1999. Authors will be notified of acceptance by September 20, 1999. A booklet of abstracts will be distributed at the workshop and made available electronically on the Web. There will be no formal proceedings for this workshop, but selected papers will be invited to a special issue of the journal "Computational Geometry: Theory and Applications". Program Committee Pankaj K. Agarwal (Duke University), Lars Arge (Duke University), Michael T. Goodrich (Johns Hopkins University), S. Rao Kosaraju (Johns Hopkins University), Subodh Kumar (Johns Hopkins University), Joseph S. B. Mitchell (State University of New York at Stony Brook), Franco P. Preparata (Brown University), Roberto Tamassia (Brown University), Jeffrey S. Vitter (Duke University). Note: For more information about the workshop, send mail to cgc@cs.jhu.edu . Further information will be posted to our web site: http://www.cs.jhu.edu/labs/cgc/cgc99 as soon as it is available. Important Dates Deadline for submission Sep 10 Notification of acceptance Sep 20 Conference Oct 15-16 Subodh Kumar ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From jsbm at ams.sunysb.edu Thu Jul 15 08:05:16 1999 From: jsbm at ams.sunysb.edu (Joseph Mitchell) Date: Mon Jan 9 13:40:57 2006 Subject: visiting position or postdoc opportunity Message-ID: <199907151105.HAA05056@amirani.ams.sunysb.edu> Postdoctoral or Visiting Position starting Fall, 1999 Computational Geometry Lab University at Stony Brook We anticipate having a postdoctoral or visiting position available at the University at Stony Brook, in the Department of Applied Mathematics and Statistics, starting in the fall of 1999. Duties would include: 1. Conducting research, in collaboration with Stony Brook faculty and students, in support of various projects in the areas of algorithms and computational geometry, with applications in computer graphics, visualization, manufacturing, and GIS. 2. Assisting in the supervision of graduate students in the Lab. 3. Modest teaching (one course in the first semester; 1-2 in the second, depending on involvement in research projects). Faculty in the algorithms/geometry area include Estie Arkin, Joe Mitchell, Michael Bender, Steve Skiena, Amitabh Varshney, and adjuncts Martin Held, Claudio Silva, Karel Zikan. In addition, there are opportunities to collaborate with the Center for Visual Computing (Ari Kaufman, director) at Stony Brook. To be considered for the position, send a notice of intent, and a vita (in ascii, latex, or ps) to Joe Mitchell (jsbm@ams.sunysb.edu), by July 22, 1999. (original closing date of July 15 has been extended, due to a delay in the first posting) The University at Stony Brook is an Equal Opportunity employer. ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From snoeyink at cs.ubc.ca Wed Jul 14 18:20:27 1999 From: snoeyink at cs.ubc.ca (Jack Snoeyink) Date: Mon Jan 9 13:40:57 2006 Subject: 11th Canadian Conference on Computational Geometry Message-ID: <199907150020.RAA26874@pedigree.cs.ubc.ca> -------------------------------------------------------- Eleventh Canadian Conference on Computational Geometry University of British Columbia, Vancouver, Canada August 15-18, 1999 http://www.cs.ubc.ca/conferences/CCCG -------------------------------------------------------- CCCG'99 will be held at UBC, Vancouver, Canada, August 15-18, 1999, immediately following WADS '99 which is in downtown Vancouver. More details can be found on the web page http://www.cs.ubc.ca/conferences/CCCG Please note that the deadline for arranging accommodations on campus is July 15. There are forms that can be downloaded from the web page, filled in, and faxed to the UBC Conference Centre. Registration will occur on-site, although we would appreciate a message through the web pages or directly to efong@cs.ubc.ca stating your intention to come. There is an opportunity to order tickets to "Bard on the Beach" performances through the web pages. Hope to see you in Vancouver. o Jack _/\_. snoeyink@cs.ubc.ca (')>-(`) http://www.cs.ubc.ca/spider/snoeyink/ ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From jlindy at eecs.tufts.edu Wed Jul 21 13:30:04 1999 From: jlindy at eecs.tufts.edu (Seg Fault) Date: Mon Jan 9 13:40:57 2006 Subject: geometric Medial Axis Transform software In-Reply-To: Message-ID: I am doing work this summer in the area of the Firehydrant Problem as posed by Freeman. Developing a software implementation of a medial axis tranform (not necessarily a very fast one; there is an algorithm by Yao and Rokne '91 that is O(n^2) which is simple enough) is part of my efforts. In searching, I have found a few programs to do medial axis transform (in particular Anthony Lau's Java program and R.L. Ogniewicz's in C.) However, all of the software that I have found has used finite point sets to approximate the segments of the simple polygon, rather than instances of geometric classes such as those found in LEDA (the software package I am working in). Does anyone know of an implementation of the medial axis transform that uses geometric objects (segments, rays, et ceteras...) rather than approximating the figures? -Jeff Lindy Tufts University EECS class of 2001 ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. From Carine.Bonetto at sophia.inria.fr Wed Jul 21 17:04:46 1999 From: Carine.Bonetto at sophia.inria.fr (Carine Bonetto) Date: Mon Jan 9 13:40:57 2006 Subject: Painter's algorithm Message-ID: <199907211404.QAA02321@gemma.inria.fr> I'm in search of any kind of information concerning the painter's algorithm, more exactly concerning a depth-Sort Algorithm (source code, URL...) Thanks Carine Bonetto INRIA Sophia-Antipolis ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From skala at kiv.zcu.cz Wed Jul 28 18:30:44 1999 From: skala at kiv.zcu.cz (Vaclav Skala) Date: Mon Jan 9 13:40:57 2006 Subject: WSCG - Int.conf. on Computer Graphics, Visualization and Digital Media - close to Prague, Czech Republic Message-ID: <000a01beda61$d5f5ef20$362be493@uk426pc04-kiv.fav.zcu.cz> WSCG'2000 Call for Papers ========================= The First Announcement Deadline for papers: October 13, 1999 Conference dates: February 7. - 11., 2000 Information: http://wscg.zcu.cz W S C G'2000 The 8-th International Conference in Central Europe on Computer Graphics, Visualization and Digital Interactive Media 2000 in cooperation with EUROGRAPHICS and IFIP working group 5.10 on Computer Graphics and Virtual Worlds will be held in February 7 - 11, 2000 in Plzen close to PRAGUE, the capital of the Czech Republic ----------------------------------------------------------------------- >> If you are willing to help us as a REVIEWER, please, << >> fill in the form at the http://wscg.zcu.cz/reviewer.htm << ----------------------------------------------------------------------- Conference Chairs ================= Nadia Magnenat Thalmann, MIRALab-CUI, Univ. of Geneva, Switzerland Vaclav Skala, Univ. of West Bohemia, Czech Republic Sponsors and supporting organizations ===================================== (Preliminary) Digital Equipment, Hewlett Packard, IBM, Silicon Graphics, Intergraph, Bentley Systems, Microsoft Topics included --------------- Fundamental algorithms, rendering and visualization, virtual reality, animation and multimedia, medical imaging, geometric modelling and fractals, graphical interaction, object-oriented graphics, WWW technologies, standards, computer vision, parallel and distributed graphics, computational geometry, computer aided geometric design, CAD/CAM, DTP and GIS systems, educational aspects of related fields, usage of graphics within mathematical software (Maple, Mathematica, MathCAD etc.) in education The program includes international books exhibition and video show, too. --------------------------------------------- W S C G '2000 International Exhibition ------------------------------------ Information for exhibitors: Please contact the organiser as soon as possible -------------------------- for detailed information and conditions. The WSCG98 Exhibition will be held in parallel. Top leading European and Czech companies active in computer graphics, visualization and computer vision, CAD/CAM and GIS systems, virtual reality, multimedia systems and others will be presenting their latest products. Special programme will be available, too. ----------------- Accepted papers will be published in the Conference proceedings with ISBN. They are reviewed by INSPEC, Cambridge Scientific Abstracts, InfoStore, IEEE , ISI , AIMS , INIST and others for citations index and other purposes. The best papers will be considered for possible publication in the Journal of Visualisation and Computer Animation, Computers&Graphics, The Visual Computer, Machine Graphics & Vision and others journals. Organizer and conference secretariat ------------------------------------ Vaclav Skala c/o Computer Science Dept., Univ.of West Bohemia Univerzitni 8, Box 314, 306 14 Plzen, Czech Republic e-mail: skala@kiv.zcu.cz Subject: INFO WSCG tel.:+420-19-7491-188 fax:+420-19-7822-578 The latest information is available at: http://wscg.zcu.cz select WSCG'2000 Information on all WSCG conferences: http://wscg.zcu.cz In case of any problems use: http://147.228.63.9 or send a mail to maxvs@bath.ac.uk ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html.