From hert at mpi-sb.mpg.de Mon Aug 13 21:11:59 2001 From: hert at mpi-sb.mpg.de (hert@mpi-sb.mpg.de) Date: Mon Jan 9 13:41:02 2006 Subject: CGAL 2.3, Computational Geometry Algorithms Library Message-ID: <200108131811.UAA08254@mpii01905.ag1.mpi-sb.mpg.de> We are pleased to announce release 2.3 of CGAL, the Computational Geometry Algorithms Library. Major additions in this release include: o Realization of a new kernel concept that provides more flexibility while being completely compatable with the previous design o d-dimensional kernel, convex hull and Delaunay triangulations o Redesign of the halfedge data structure to provide better extensibility o Improvements and additions in 2d and 3d triangulations and 2d planar maps and arrangements. o Boolean operations on polygons provided via 2d Nef polyhedra o Dependencies on the LEDA library have been removed, except in the case of the PostScript stream. See http://www.cgal.org/releases_frame.html for a 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 visualisation, 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/ For information about services supporting and complementing CGAL, please visit: http://www.geometryfactory.com 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 ------------------------------------------------------------------------- ------------- 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 pankaj at cs.duke.edu Sun Aug 19 10:06:45 2001 From: pankaj at cs.duke.edu (Pankaj Kumar Agarwal) Date: Mon Jan 9 13:41:02 2006 Subject: CG Steering Committee Message-ID: <200108191306.JAA07509@kant.cs.duke.edu> I am pleased to announce the results of our Steering Committee election. One hundred and thirty one ballots were received, each recording votes for up to five candidates. The five candidates who received the most votes are: Nina Amenta Jeff Erickson Dan Halperin Marc van Kreveld Joseph Mitchell The new committee has chosen Joe to be the chair and Marc to be the general secretary. The new committee will serve for two years, and the next election will be held in Spring 2003. I wish all the best to the new committee, and I thank you all for participating in our election. -Pankaj ------------- 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 mount at cs.umd.edu Wed Aug 22 07:51:43 2001 From: mount at cs.umd.edu (Dave MOUNT) Date: Mon Jan 9 13:41:02 2006 Subject: ALENEX 02 Call for Papers Message-ID: CALL FOR PAPERS 4th Workshop on Algorithm Engineering and Experiments ALENEX 02 January 4-5, 2002, San Francisco, California Radisson Miyako Hotel GENERAL INFORMATION: The aim of the annual ALENEX workshops is to provide a forum for the presentation of original research in the implementation and experimental evaluation of algorithms and data structures. We invite submissions that present significant case studies in experimental analysis (such studies may tighten, extend, or otherwise improve current theoretical results) or in the implementation, testing, and evaluation of algorithms for realistic environments and scenarios, including specific applied areas (including databases, networks, operations research, computational biology and physics, computational geometry, and the world wide web) that present unique challenges in their underlying algorithmic problems. We also invite submissions that address methodological issues and standards in the context of empirical research on algorithms and data structures. The scientific program will include invited talks, contributed research papers, and ample time for discussion and debate of topics in this rapidly evolving research area. A proceedings will be published, and a special issue of the ACM Journal of Experimental Algorithmics will feature invited contributions from the workshop. This workshop is colocated with the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA02), and will take place in the two days preceding that conference. A paper that has been reviewed and accepted for presentation at SODA is not eligible for submission to ALENEX. We recognize, however that some research projects spawn multiple papers that elaborate on different aspects of the work and are willing to respond to inquiries about overlapping papers. The workshop is supported by SIAM, the Society for Industrial and Applied Mathematics, and SIGACT, the ACM Special Interest Group on Algorithms and Computation Theory. SUBMISSIONS: Authors are invited to submit 10-page extended abstracts by 5:00 PM EDT, OCTOBER 8, 2001 and must use the SIGACT electronic submissions server. Detailed instructions for submitting to the workshop can be found at the workshop's website. http://cs.umd.edu/~mount/ALENEX02 Notification of acceptance or rejection will be sent by November 5, 2001. The deadline for receipt of papers in final version is December 10, 2001. Presenters must have submitted the final versions of their papers in order to be able to present them at the workshop. PROGRAM COMMITTEE: Nancy Amato, Texas A&M University Marshall Bern,Xerox PARC Michael Goodrich, Johns Hopkins University Tom McCormick, University of British Columbia Michael Mitzenmacher, Harvard University David Mount, (Co-chair), University of Maryland Giri Narasimhan, University of Memphis Rajeev Raman, University of Leicester Clifford Stein, (Co-chair), Columbia University ------------- 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 snodden at kiv.zcu.cz Wed Aug 29 12:08:14 2001 From: snodden at kiv.zcu.cz (Michael) Date: Mon Jan 9 13:41:02 2006 Subject: WSCG Conference 2002 Message-ID: WSCG Conference 2002- Pilsen (Close to Prague), Czech Republic ============================================================== The 10-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision http://wscg.zcu.cz February 4 - 8, 2002 Honorary Chair: Jos? Encarna?ao, Fraunhofer-Institute for Computer Graphics, Darmstadt, Germany Keynote speakers: Gabriel Taubin: Signal Processing on Polygonal Meshes, Watson Research Center, IBM, USA Chandrajit Bajaj: Active Visualization using PC clusters and Tiled Displays, University of Texas at Austin, USA Programme Co-chairs Nadia Magnenat Thalmann, MIRALab-CUI, Univ. of Geneva, Switzerland Vaclav Skala, Univ. of West Bohemia, Czech Republic Deadline for paper submission: October 10, 2001 Contact person: Vaclav Skala - skala@kiv.zcu.cz , fax +420-19-74 91 188 PLEASE include your e-mail **We apologise for any duplicate emails - if you wish to have an address removed from our list, please follow the instructions below. The attached .pdf file contains information on WSCG paper submissions for the 2002 conference. This mail has been sent to you either as a result of a previously expressed wish to receive details from us, or because a colleague has recommended you as somebody who would be interested in contributing to the conference in some capacity. If this is not the case, please email snodden@kiv.zcu.cz with "Remove Me" as the subject line, including all email addresses that you wish to have removed -------------- next part -------------- A non-text attachment was scrubbed... Name: CallforPapers_Participation2002.pdf Type: application/pdf Size: 5524 bytes Desc: not available Url : http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20010829/21dd8895/CallforPapers_Participation2002.pdf From amber_ag at lycos.com Wed Aug 29 10:24:22 2001 From: amber_ag at lycos.com (Amber Agrawal) Date: Mon Jan 9 13:41:02 2006 Subject: Polygonalization and Trapezoidalization Message-ID: Q1. Can anybody give me some algorithm or pointer to a algorithm for Trapezoidalization of a generic polygon? Q1.1 Is there any algorithm, which gives the minimum number of axis parallel trapezoid as a output of the Trapezoidalization of a generic polygon? Q2. Can anybody give me some good algorithm or pointer to algorithm for Polygonalization of axis parallel trapezoids? One trivial solution for Q2 is same as input (Viz. set of input axis parallel trapezoid), because each trapezoid in nothing but generic polygon. But, I want to minimize the number of generic polygon, Terminology used in above questions: Trapezoidalization: Decomposing the generic polygon into axis-parallel trapezoids. Polygonalization: Given the set of non-overlapping axis-parallel trapezoids, generate the set of non-overlapping generic polygon such that both (set of input non-overlapping axis-parallel trapezoids and set of output non-overlapping generic polygon) cover the same area in 2D plan. Generic Polygon: It(polygon) may be self-intersecting and also may have holes in it. Axis Parallel Trapezoid : Two edges of the trapezoid are parallel to x-axis or y-axis. thanks, Amber Agrawal. Get 250 color business cards for FREE! http://businesscards.lycos.com/vp/fastpath/ ------------- 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 joeyc at cunyvm.cuny.edu Thu Aug 30 13:41:42 2001 From: joeyc at cunyvm.cuny.edu (Joseph Malkevitch) Date: Mon Jan 9 13:41:02 2006 Subject: Polygonalization and Trapezoidalization References: Message-ID: <3B8E6C67.3199@cunyvm.cuny.edu> Dear Amber, This is probably not what you are looking for but check out: US Patent: 5,129,051 (Hewlett-Packard) Decomposition of arbitrary polygons into trapezoids (Issued July 7, 1992)!!! Best wishes, Joe -- Joseph Malkevitch Department of Mathematics York College (CUNY) Jamaica, New York 11451 Phone: 718-262-2551 Web page: http://www.york.cuny.edu/~malk ------------- 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.