From MiRu at acm.org Wed May 2 18:38:57 2001 From: MiRu at acm.org (Michael Rund) Date: Mon Jan 9 13:41:01 2006 Subject: position announce: geometric modeling specialist Message-ID: <002c01c0d350$617250a0$6e3a84ac@oemcomputer> please post: Employment Positions: To work with company principals and recognized world class leaders in computer graphics, award winning R&D of CAD/CAM and new 3-d paradigms for implicit parametric surfaces, isosurfaces, volume visualization approaches, features and solid modeling strategies. We are looking for senior research assistants or associates who have some of the following experience: -Sr./Principle Geometric Modeling Specialists (multiple); -3-d Modeling Software Development, -Variational/Parametrics Modeling Software Development, -Visualization development (multiple), -3-d Graphics software engineers (multiple) Geometric modeling and visualization development, curve and surface mathematics, C or C++ programming, solids representations, hi-level 3-d development. The overall approach is variational, feature-based, next-generation development. Skills & Experience required: Curve & Surfaces, NURBS, geometric modeling OR solids modeling or parametric constraints/variational geometry OR CAD geometry (Pro/E, Unigraphics, Intergraph, CATIA, IDEAS, etc.) OR graphics pipelines and 3-d visualization of CAD modeling object software, OR API open architecture programamatic interface (C++) OR Release Management OR device-level 3-d graphics development (Open GL,PEX) OR Sub-specialties: topology, NURBS libraries, fillets, foreign CAD data topology cleaners OR Databases for part planning. An extensive next-generation type project to rebuild a powerful 3-d software presently resident on workstations into the world's most advanced graphical modeling software. Excellent salaries will be offered. Benefits, incentives, bonuses, and full, extended relocation will be offered AND the opportunity to build a smaller company into a big and very important company, partnering with the best CAD and graphics software manufacturers supported by the world's leading providers of design and engineering software - with over 1 million customers of CAD and a supply chain in the manufacturing industry, a market place doing 1.8 trillion dollars worth of commerce annually in the US alone. These are full time, permanent positions to support long term development. Jr. and mid-level positions are also available to support this work in a friendly development environment named by ComputerWork magazine as one of the top 100 software companies to work for based on salary, benefits, opportunity, management and work environment and culture. Join an established and highly successful company, an industry leader with wide ranging contracts in design automation, manufacturing, and graphics. The development location is in an ideal area with a very low cost of living and temperate climate. Visa sponsorship available. To apply in confidence please send your resume and / or contact: Michael Rund Tech Visions e-mail: MiRu@acm.org - - e-mail resumes accepted or fax (706)-864-1255 - my direct fax or call (706)-864-1244 - my direct line -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20010502/2eede3f5/attachment.htm From george at cs.ucy.ac.cy Tue May 8 17:24:32 2001 From: george at cs.ucy.ac.cy (George Angelos Papadopoulos) Date: Mon Jan 9 13:41:01 2006 Subject: Academic Vacancies -- CS Dept -- Univ. of Cyprus Message-ID: *** ANNOUNCEMENT OF ACADEMIC POSITIONS *** The University of Cyprus announces the following non permanent posts (Assistant Professor or Lecturer): DEPARTMENT OF COMPUTER SCIENCE 4 non permanent posts in the following fields of study: * Software Engineering * Computer Architecture * Information Systems * Computer Networks * Database Systems * Internet Technologies For all academic ranks, a Ph.D. from a recognized University is required. PLEASE NOTE: The languages of instruction are Greek and Turkish. Applicants need not be citizens of the Republic of Cyprus. The annual salaries for these positions (including the 13th salary) are: Assistant Professor (Scale A13-A14) CY22,939 - CY30,914 Lecturer (Scale A12-A13) CY19,372 - CY28,373 (At present 1 CY = 1.0769 sterling and 1 CY = 1.5370 dollars) Interested individuals must submit the following items by Friday 6th of July 2001: I A letter stating the department, the academic rank or ranks for which the applicant is interested in, the field or fields of study and the date when he/she may be able to assume duties in the event of selection. II A Curriculum Vitae (6 copies). III A brief summary (not exceeding three pages) of their research work as well as a description of plans for future research (6 copies). IV A list of publications (6 copies). V Copies of representative publications (6 copies if possible). VI Copies of their qualifications. In addition, the applicants must request three academic referees to send letters of recommendation directly to the University; the names and addresses of these referees must be submitted with the application. Additional confidential information may be sought. The Curriculum Vitae and the brief summary of the research work should be written in Greek or Turkish and in one international language, preferably English. Applications, other documents and reference letters submitted in the past will NOT be considered and must be re-submitted. Applications that are not complete will not be considered. The above must reach the University by 2 pm Friday 6th of July 2001 at the following address: The Registrar University of Cyprus P O Box 20537 CY-1678 Nicosia CYPRUS Tel: 02-892000 Fax: 02-892100 For more details and other information interested individuals may contact the Head of the Department of Computer Science, Associate Professor Antonis Kakas: Tel: +357-2-892231 Fax: +357-2-339062 E-mail: antonis@cs.ucy.ac.cy ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From dls at eecs.tufts.edu Tue May 8 22:08:47 2001 From: dls at eecs.tufts.edu (dls@eecs.tufts.edu) Date: Mon Jan 9 13:41:01 2006 Subject: ACM Symposium on Computational Geometry Message-ID: <200105090108.VAA16918@andante.eecs.tufts.edu> REGISTER NOW! EARLY REGISTRATION ENDS 5/10 1-day rate ** 3-day rate ** student rates http://www.eecs.tufts.edu/EECS/scg01 17th Annual ACM Symposium on June 3--5, 2001 Tufts University Medford/Somerville, MA, USA INVITED SPEAKERS: Thomas Hales (University of Michigan): Sphere Packings and Generative Programming Fred Richards (Yale University): Protein Geometry as a Function of Time George W. Hart (http://www.georgehart.com): Computational Geometry for Sculpture Sponsored by: ACM Special Interest Groups on Graphics (SIGGRAPH) and Algorithms and Computation Theory (SIGACT) With support from: Mitsubishi Electric Research Labs (MERL) School of Engineering, Tufts 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 wslee at miralab.unige.ch Wed May 9 19:52:02 2001 From: wslee at miralab.unige.ch (Wonsook Lee) Date: Mon Jan 9 13:41:01 2006 Subject: job searching in Computer Graphics, VR, e-commerse and Medical fields Message-ID: <003301c0d8a8$5f2c54a0$9d44c281@unige.ch> Whom it may concern, This is WonSook Lee from MIRALab, Center University of Information (Computer Science), University of Geneve, Switzerland. I am a senior research assistant at this moment. I am now looking for a job. My background is mathematics and computer science mainly computer graphics, VR, e-commerse and Medical fields. My CV is shown in http://miralabwww.unige.ch/~wslee/CV/cv.html and my homepage is in http://miralabwww.unige.ch/~wslee. Please have a look and forward my CV to intereting people if any. Best regards & wishes, *w* ------------- 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 mutzel at ads.tuwien.ac.at Thu May 10 18:17:53 2001 From: mutzel at ads.tuwien.ac.at (Petra Mutzel) Date: Mon Jan 9 13:41:01 2006 Subject: Graph Drawing 2001 --- Vienna Message-ID: <3AFAB121.950DB7F5@ads.tuwien.ac.at> ********************************************************************* ** ** ***** Second and Final Call for Papers and Software ***** ****** ****** ******** G R A P H D R A W I N G 2 0 0 1 ******** ******** ******** ******** September 23-26, 2001, Vienna, Austria ******** ****** ****** ***** http://www.ads.tuwien.ac.at/gd2001 ***** ** ** ********************************************************************* N E W S INVITED LECTURES It is a special pleasure to announce that Alexander Schrijver (Amsterdam) and Eduard Groeller (Vienna) have accepted our invitation to present invited lectures. Their talks will mark extreme points of the wide spectrum of graph drawing, the mathematical foundations and the computer graphics, respectively. SUBMISSION OF PAPERS AND SOFTWARE Most important: Please remember the submission deadline: May 28, 2001 The GD2001 web site is now fully set up to support comfortable submission of papers and software. Indeed a number of submissions have already been received. There have been several requests concerning the software submission rules. We found that requesting a poster by May 28 was not a good idea, so we relax this requirement and redefine an acceptable submission as follows: * SOFTWARE: A contribution to the software exhibition consists of the software in executable format for Windows, Linux, or Solaris and a 2 page short description in Springer LNCS-style format, including fax number and e-mail address. Accepted software will have to be documented by a poster at the conference. Participants and guests of GD2001 will have the opportunity to use the software during the conference. In collaboration with the authors/owners, the organizers guarantee that they will make sure that the software is adequately protected and the production of unauthorized copies is prevented. GRAPH DRAWING CONTEST The graph drawing competition and the nomination of the winners has been among the highlights of the past graph drawing symposia. It's both fun and a challenge and has inspired new research in graph drawing. See the GD2001 web site for the complete set of challenges and data. REGISTRATION Please register at the GD2001 web site at your earliest convenience. ACCOMMODATION September is high season in Vienna; it may be hard to get a hotel room within walking distance after May 2001. Therefore, we recommend reservation of a hotel room as soon as possible. The GD2001 web site gives you support by listing several hotels you may want to consider. CONFERENCE DINNER The conference dinner will be at Stift Klosterneuburg near the city of Vienna. PLEASE VISIT THE GD2001 WEB SITE! If you have not visited the GD2001 web site lately, please try: Many new items have been added recently, and we'll keep it up-to-date. SPECIAL FINANCIAL SUPPORT The organizers have applied for funding the participation of young researchers from eastern European countries. Please contact them if you are eligible and interested. ORIGINAL CALL WITH CORRECTED SOFTWARE SUBMISSION RULES *********************************************************************** ***** Call for Papers ***** ****** ****** ******** G R A P H D R A W I N G 2 0 0 1 ******** ******** ******** ******** September 23-26, 2001, Vienna, Austria ******** ****** ****** ***** http://www.ads.tuwien.ac.at/gd2001 ***** *********************************************************************** *** Scope: *** Theory - Algorithms - Software. The symposium is a forum for researchers, practitioners, developers, and users working on all aspects of graph visualization and representation. The range of issues considered in graph drawing includes graph algorithms, graph theory, computational geometry, topology, planarity issues, combinatorics, optimization, heuristics, local search, computational cartography, information visualization, visual languages, visual perception, computer-human interaction, applications, and practical systems. Graph drawing is becoming increasingly important in many applications including visualization tasks in software engineering (e.g., automatic layout of UML-diagrams), business process modeling (e.g., organization diagrams, event-driven process chains), and computational biology (e.g., display of biochemical pathways). Researchers and practitioners with an interest in these or other applications are especially welcome to participate. *** Software_Exhibition: *** During the conference there will be a graph drawing software exhibition for which we hope to attract all state-of-the-art software tools in graph drawing. The software will be accessible for all conference participants on computers in the hall of the conference building. *** Graph_Drawing_Contest: *** See the GD 2001 web site. *** Location: *** The conference will take place in the building of the Austrian Academy of Sciences (picture on the 100 schilling bank note) which is located in the center of Vienna at Dr. Ignaz Seipel Platz 2 (about 3 minutes walking distance from Stephansdom). *** Call_for_Papers_and_Software: *** * PAPERS: We invite papers describing original research of theoretical or practical significance to graph drawing. A submission consists of a standard PostScript or PDF file of an extended abstract or full draft paper of at most 15 pages in Springer LNCS-style format, including fax number and e-mail address. * SOFTWARE: A contribution to the software exhibition consists of the software in executable format for Windows, Linux, or Solaris and a 2 page short description in Springer LNCS-style format, including fax number and e-mail address. Accepted software will have to be documented by a poster shortly before the conference. Please e-mail submissions to gd2001@ads.tuwien.ac.at by May 28, 2001. See http://www.springer.de/comp/lncs/authors.html for Springer LNCS-style format requirements. *** Proceedings: *** Accepted papers (at most 15 pages) and software (2 pages) will be published in the conference proceedings, which will appear in the series Lecture Notes in Computer Science of Springer-Verlag. The camera-ready copy as well as electronic files of accepted papers and software are due at the conference. A selection of the exhibited software will be invited to contribute to a book on state-of-the-art graph drawing software. This book will be one of the first volumes in a new book series called "Mathematics and Visualization" that will be launched by Springer-Verlag. *** Program Committee: *** Petra Mutzel, Vienna University of Technology - chair Michael Juenger, University of Cologne - co-chair Franz Aurenhammer, Graz University of Technology Therese Biedl, University of Waterloo Giuseppe Di Battista, University of Rome III Franz Brandenburg, University of Passau Yefim Dinitz, Ben Gurion University Peter Eades, University of Sydney Herbert Fleischner, Austrian Academy of Sciences Hubert de Fraysseix, CNRS Paris Mike Goodrich, Johns Hopkins University Jan Kratochvil, Charles University Prague Giuseppe Liotta, University of Perugia Brendan Madden, Tom Sawyer Software Shin-ichi Nakano, Gunma University *** Organizing Committee: *** Petra Mutzel, Vienna University of Technology - chair Michael Juenger, University of Cologne - co-chair Leonid Dimitrov, Austrian Academy of Sciences Barbara Hufnagel, Vienna University Of Technology Gunnar Klau, Vienna University of Technology Sebastian Leipert, caesar Bonn Rene Weiskircher, Vienna University Of Technology Emanuel Wenger, Austrian Academy of Sciences *** Software Exhibition Organizers: *** Martin Gruber, Vienna University of Technology Thomas Lange, University of Cologne *** Graph Drawing Contest Organizer: *** Franz Brandenburg, University of Passau *** Important Dates:*** Submission of papers and software: May 28, 2001 Notification of acceptance: July 17, 2001 Registration: July 31, 2001 Final version due: Sept. 23, 2001 *** Contact Information: *** Petra Mutzel - GD 2001 Institute of Computer Graphics and Algorithms Vienna University of Technology Favoritenstr. 9-11 E186 A-1040 Vienna, Austria ----- fax: +43 1 58801 18699 phone: +43 1 58801 18611 e-mail: gd2001@ads.tuwien.ac.at **** Graph Drawing 2001 Web Site: **** http://www.ads.tuwien.ac.at/gd2001 *********************************************************************** **** GD 2001 is organized by Vienna University of Technology, ***** **** Austrian Academy of Sciences, and University of Cologne ***** *********************************************************************** -- Univ.-Prof. Dr. Petra Mutzel Abt. fuer Algorithmen und Datenstrukturen Institut fuer Computergraphik und Algorithmen Favoritenstrasse 9-11 E186/1, A-1040 Wien, Austria ------------- 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 ehmann at cs.unc.edu Thu May 10 01:04:35 2001 From: ehmann at cs.unc.edu (Stephen Ehmann) Date: Mon Jan 9 13:41:01 2006 Subject: SWIFT++: A new collision detection package Message-ID: <200105100404.AAA05538@capefear.cs.unc.edu> SWIFT++: Speedy Walking via Improved Feature Testing for Non-Convex Objects We announce the release of a new proximity query package called SWIFT++. SWIFT++ is a C++ library for intersection detection, tolerance verification, exact and approximate distance computation, and contact determination of general three-dimensional polyhedral objects undergoing rigid motion. Polyhedral surfaces may have boundary. SWIFT++ combines convex surface decomposition with a convex bounding volume hierarchy and Voronoi based walking (first proposed by Lin and Canny). It has been successfully applied to dynamic simulation and haptic applications. 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/SWIFT++ Collide Research Group Computer Science Department University of North Carolina -- Stephen A. Ehmann Graduate Student -- Research Assistant -- GAMMA group -- Collision Detection Department of Computer Science E-mail: ehmann@cs.unc.edu University of North Carolina at Chapel Hill Web: www.cs.unc.edu/~ehmann (( A man's life is but a breath. -- SPOKEN )) ------------- 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 wfrankli at nsf.gov Mon May 21 22:26:26 2001 From: wfrankli at nsf.gov (Wm. Randolph Franklin) Date: Mon Jan 9 13:41:01 2006 Subject: CARGO, new NSF solicitation is out Message-ID: <200105220126.VAA26681@ecse.rpi.edu> See http://www.nsf.gov/cgi-bin/getpub?nsf01111 CARGO = Computational Algorithms and Representations for Geometric Objects /Randolph ======================== WR Franklin, Program Director NSF/CISE/C-CR, 4201 Wilson Blvd, Room 1145 Arlington VA 22230 wfrankli@nsf.gov +1 (703) 292-8912 Fax: +1 (703) 292-9059 ------------- 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 taubin at bologna.vision.caltech.edu Tue May 22 10:41:43 2001 From: taubin at bologna.vision.caltech.edu (Gabriel Taubin) Date: Mon Jan 9 13:41:01 2006 Subject: CFP: Graphics Models, Special Issue on Processing of Large Polygonal Meshes References: <200103260407.XAA04535@piano.eecs.tufts.edu> Message-ID: <005a01c0e2de$157f3850$0286d783@mesh> 2nd. CALL FOR PAPERS GRAPHICS MODELS http://www.academicpress.com/gmod Special Issue on Processing of Large Polygonal Meshes Guest Editor GABRIEL TAUBIN California Institute of Technology and IBM T.J. Watson Research Center Very large polyhedral models, which are used in more and more in graphics applications today, are routinely generated by a variety of methods such as surface reconstruction algorithms from 3D scanned data, iso-surface construction algorithms from volumetric data, and photogrametric methods from aerial photography. The special issue will focus on methods designed to smooth, denoise, edit, compress, transmit, and animate very large polygonal meshes, based on signal processing techniques, constrained energy minimization, and the solution of diffusion differential equations. Examples of topics of interest include, but are not limited to: - Representation and operations on large polygonal meshes - Connectivity operators - Geometry operators - Linear and non-linear Smoothing techniques - Filtering of normal and tensor fields - Anisotropic diffusion on meshes - Mesh sampling rate conversion / resampling - Curvature-based resampling - Fourier analysis on meshes and linear filter design - Mesh fairing by constrained energy minimization - Mesh fairing by solving PDEs - Multiresolution representations, editing, and smoothing - Applications to subdivision surfaces - Applications to 3D geometry compression / progressive transmission - Dynamic meshes Prospective authors are encouraged to submit high quality, original works which have not appeared, nor are under consideration, in any other journals. Dates: + Submission Deadline: 09/15/2001 + Reviews returned to Authors: 12/31/2001 + Revised paper due by: 01/31/2002 + Acceptance decisions due by: 02/15/2002 + Final version due by: 02/28/2002 + Planned publication date: 07/2002 Electronic Submission : Papers should be submitted electronically in PDF format. Send your submission as an attachement by email to taubin@us.ibm.com Three hard-copy printouts exactly matching the electronic file must be supplied as well. Academic Press (AP) encourages all of its authors to prepare and transmit their manuscripts and associated materials electronically. Information about preparation of electronic files can be found here http://www.academicpress.com/www/journal/esub.htm ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From jsbm at ams.sunysb.edu Fri May 25 00:19:22 2001 From: jsbm at ams.sunysb.edu (jsbm@ams.sunysb.edu) Date: Mon Jan 9 13:41:02 2006 Subject: call for business meeting agenda items Message-ID: <200105250319.XAA04342@amirani.ams.sunysb.edu> Dear Members of the Computational Geometry Community, The annual SoCG business meeting will be held on Sunday, June 3 (5:30pm). We are currently collecting business agenda items for the meeting. Please let me know if you have announcements or discussion items to raise. SoCG'2002 will take place in Barcelona; we will hear from one of the conference chairs (Ferran Hurtado) on how plans are shaping up. Last year at the business meeting, we had a straw vote showing a considerable majority favoring to join FCRC in 2003. We will have a report on the latest FCRC'2003 plans at our meeting this year and will hold a binding vote whether or not to join FCRC in 2003. In case the vote goes against joining FCRC, bids for hosting SoCG'2003 will be welcome. See you in Medford! Joe Mitchell Steering Committee jsbm@ams.sunysb.edu ------------- 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 heitzig at mbox.math.uni-hannover.de Fri May 18 15:21:41 2001 From: heitzig at mbox.math.uni-hannover.de (Jobst Heitzig) Date: Mon Jan 9 13:41:02 2006 Subject: Angles in a convex pentagon? Message-ID: Does anyone know whether the following is true in a convex pentagon ABCDE: Given that EA>AB>BC and CD Message-ID: The following 45 papers have been accepted to CCCG'01: The Reflex-Free Hull Hee-kap Ahn, Siu-wing Cheng, Otfried Cheong, Jack Snoeyink The Point Set Order Type Data Base: A Collection of Applications and Results Oswin Aichholzer, Hannes Krasser On the Number of Triangulations every Planar Point Set must have Oswin Aichholzer, Ferran Hurtado, Marc Noy Algorithms for Bivariate Medians and a Fermat-Torricelli Problem for Lines Greg Aloupis, Stefan Langerman, Michael Soss, Godfried Toussaint Good Approximations for the Relative Neighbourhood Graph Diogo Vieira Andrade, Luiz Henrique de Figueiredo Line Voronoi diagram based interpolation and application to digital terrain modelling Francois Anton, Darka Mioc, Christopher M. Gold Computational analysis of 4-8 meshes with application to surface simplification using global error Laurent Balmelli, Thomas Liebling, Martin Vetterli A Simpler Circular Ray Shooting Algorithm Ralph P. Boland, Jorge Urrutia Finding the Largest Axis Aligned Rectangle in a Polygon in O(n log n) time Ralph P. Boland, Jorge Urrutia Guarding Lines and 2-Link Polygons is MAXSNP-Hard Bjorn Broden, Mikael Hammar, Bengt J. Nilsson Binary Space Partitioning Tree and Constructive Solid Geometry Representations for Objects Bounded by Curved Surfaces Suzanne F. Buchele, Angela C. Roles On Algorithms for Simplicial Depth Andrew Y. Cheng, Ming Ouyang Translational Polygon Covering using Intersection Graphs Karen Daniels, Rajasekhar Inkulu The CCCG 2001 Logo Erik D. Demaine, Martin L. Demaine, Anna Lubiw Pushing Blocks is NP-Complete for Noncrossing Solution Paths Erik D. Demaine, Michael Hoffmann Short Interlocked Linkages Erik D. Demaine, Stefan Langerman, Joseph O'Rourke Reaching Folded States of a Rectangular Piece of Paper Erik D. Demaine, Joseph S. B. Mitchell The Shuffling Buffer Olivier Devillers, Philippe Guigue Separating Several Point Sets in the Plane Olivier Devillers, Ferran Hurtado, Merce Mora, Carlos Seara Decimating Samples for Mesh Simplification Tamal K. Dey, Joachim Giesen, James Hudson Matching Points to a Convex Polygonal Boundary Matthew T. Dickerson, Michael T. Goodrich The Convex Hull in a New Model of Computation Abbas Edalat, Andre Lieutier, Elham Kashefi Complete Combinatorial Generation of Small Point Configurations and Hyperplane Arrangements Lukas Finschi, Komei Fukuda Computing the Width of a Point Set in 3-Space Bernd Gaertner, Thomas Herrmann Approximating the Shortest Path in Line Arrangements David W. Hart Segment endpoint visibility graphs are Hamiltonian Michael Hoffmann, Csaba D. Toth Local Optimization of Triangular Surface Meshes for General Quadrics in Lp Norm Jerzy W. Jaromczyk, Yang Wang Tight Degree Bounds for Pseudo-triangulations of Points Lutz Kettner, David Kirkpatrick, Bettina Speckmann Listing All Connected Plane Triangulation Zhangjian Li, Shin-ichi Nakano Parallel Searching on a Lattice Alejandro Lopez-Ortiz, Graeme Sweet Heaphull? Andrea Mantler, Jack Snoeyink On the Topology of the Level Sets of a Scalar Field Valerio Pascucci Voronoi Diagrams in Projective Geometry and Sweep Circle Algorithms for Constructing Circle-based Voronoi Diagrams' Axel Pavillet Counting triangulations and pseudo-triangulations of wheels Dana Randall, Guenter Rote, Francisco Santos, Jack Snoeyink Narrowing Light Rays with Mirrors Joseph O'Rourke, Octavia Petrovici Partitioning Orthogonal Polygons into Fat Rectangles Joseph O'Rourke, Irena Pashchenko, Geetika Tewari Heuristics for placing non-orthogonal axial lines to cross the adjacencies between orthogonal rectangles Ian Sanders, Leigh-Ann Kenny Nearest neighbor search through function minimization Chang Shu, Michael Greenspan, Guy Godin The Arithmetic Precision of Ray-Polygon Intersection Testing Jack Snoeyink Testing Extendability for Partial Chirotopes is NP-complete Falk Tschirschnitz Tiling 3D Euclidean Space with Acute Tetrahedra Alper Ungor Tutte's Barycenter Method applied to Isotopies Eric Colin de Verdiere, Michel Pocchiola, Gert Vegter Yet Another Look at Fractional Cascading: B-graphs with Application to Point Location Chee Yap, Yunyue Zhu Geometric Permutations of Balls with Bounded Size Disparity Yunhong Zhou, Subhash Suri Turing Computability of (Non-)Linear Optimization Martin Ziegler, Vasco Brattka ------------- 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 shermer at cs.sfu.ca Mon May 28 13:28:18 2001 From: shermer at cs.sfu.ca (Tom Shermer) Date: Mon Jan 9 13:41:02 2006 Subject: Angles in a convex pentagon? Message-ID: <200105281928.MAA14748@cs.sfu.ca> You can get an angle approaching pi + arccos(1/4) > pi + pi/3 by the following method: 1) Construct an equilateral not-strictly-convex pentagon with EA and AB colinear, and BC and CD colinear. 2) Wiggle it. (shrink the appropriate edges slightly, causing slight changes in the angles). Tom > Date: Fri, 18 May 2001 14:21:41 +0200 (MEST) > From: Jobst Heitzig > X-Sender: nhabheit@unics > To: compgeom-discuss@research.bell-labs.com > Subject: Angles in a convex pentagon? > MIME-Version: 1.0 > X-Scanning-Notification: This email was scanned in its path for viruses and certain attachments may have been dropped > > Does anyone know whether the following is true in a convex pentagon ABCDE: > Given that EA>AB>BC and CD > I tried hard but could neither prove nor disprove it :-) > > Jobst Heitzig > > > > ------------- > 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. ------------- 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 jarek at gvu.gatech.edu Tue May 29 23:39:37 2001 From: jarek at gvu.gatech.edu (Jarek Rossignac) Date: Mon Jan 9 13:41:02 2006 Subject: Edgebreaker 3D compression for triangle meshes Message-ID: A first version of the Edgebreaker 3D compression software is freely available from http://www.gvu.gatech.edu/~jarek/edgebreaker/eb/ Edgebreaker is a very simple state machine that encodes and decodes the connectivity of a triangle mesh as a sequence of symbols from the set {C,L,E,R,S} with a guaranteed cost of 1.8 bits per triangle and a practical cost of about 1 bit per triangle for meshes homeomorphic to a sphere and with a modest cost per handle and hole. The proposed code uses a parallelogram rule for predicting and compressing vertex location, but can be easily combined with other predictio schemes. The current version of the software supports manifold meshes with an arbitrary number of handles but a single hole. Additional holes must be filled and then removed by the application. Please let me know if you decide to use it. Thanks - Jarek -- ========================== Prof. Jarek Rossignac College of Computing & GVU Center Georgia Institute of Technology 801 Atlantic Drive NW, CCB-256 Atlanta, GA 30332-0280 Phone: 404/894-0671, Fax: 404/894-0673 http://www.gvu.gatech.edu/~jarek For assistance, please contact Pam Ruffin at (404) 385-2464, pamela@cc.gatech.edu ------------- 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 youngkim at cs.unc.edu Tue May 29 17:40:42 2001 From: youngkim at cs.unc.edu (Young J. Kim) Date: Mon Jan 9 13:41:02 2006 Subject: a Minkowski sum implementation for convex polyhedra ? Message-ID: Hello, Is there anybody who knows about a Minkowski sum implementation for two convex polyhedra ? Thanks in advance, Young. ------------- 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.