From josy at ctfd.cmmacs.ernet.in Fri Oct 3 09:38:47 2003 From: josy at ctfd.cmmacs.ernet.in (Josy P. Pullockara) Date: Mon Jan 9 13:41:12 2006 Subject: Plane-AABB Intersection. Message-ID: <1065150526.2322.5.camel@shunya.ctfd.nal.res.in> Hi, In Adaptive Cartesian 3D(2D) Methods of Computational Fluid Dynamics, it is of interest to determine volume(area) fractions when a plane(line) intersects an AABB(Axis Aligned Bounding Box). Can anyone give pointers to how one can calculate such volume-fractions for these Cartesian cells WITHOUT the construction of the complex polytopes as that would be an overkill especially in 3D. The figure below shows in 2D a line cutting the Cartesian cell. I need to know Vp/(Vp + Vn) without having multiple cases for different types of intersection (could be bad in 3D). Vp: Volume(3D) or Area(2D) on the positive(normal) side of the plane. Vn: Volume(3D) or Area(2D) on the negative(normal) side of the plane. If the below figure is not clear(fixed width fonts) see the attached files cartesian.jpg or cartesian.eps. I hope the attachments are intact as many mailing lists do not support attachments. / / Required: Vp/(Vp+Vn) +----+-------+ |Vp / | | / | | / | |/ Vn | + | /+------------+ / / If that is not known/possible please provide pointers to efficient ways to approach this problem. Thank you very much for your kind attention. -- Josy P. Pullockara Scientist, eMail:josy@ctfd.cmmacs.ernet.in Computational and Theoretical Phone:+91-80-505 1627 Fluid Dynamics Division, Fax :+91-80-522 0952 National Aerospace Laboratories Res. :+91-80-524 5053 ---------------------------------------------------------------------- Please avoid sending me Word or PowerPoint attachments. See http://www.fsf.org/philosophy/no-word-attachments.html -------------- next part -------------- A non-text attachment was scrubbed... Name: cartesian.jpg Type: image/jpeg Size: 6369 bytes Desc: not available Url : http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20031003/ed0d184e/cartesian.jpg -------------- next part -------------- A non-text attachment was scrubbed... Name: cartesian.eps Type: application/postscript Size: 3676 bytes Desc: not available Url : http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20031003/ed0d184e/cartesian.eps From christer_ericson at playstation.sony.com Fri Oct 3 14:11:13 2003 From: christer_ericson at playstation.sony.com (christer_ericson@playstation.sony.com) Date: Mon Jan 9 13:41:12 2006 Subject: OBB algorithm In-Reply-To: <65B1B826-F359-11D7-ABEA-000393D612E0@cs.uiuc.edu> Message-ID: Jeff Erickson wrote on 09/30/2003 08:18:51 AM: > Nash Aragam wrote: > > Can somebody send me a link for a quick and easy code sample/algorithm > > for computing OBB on a cloud of 3D points? Thanks much, > >[...] > > Here's code to quickly compute a provably-good approximation: > http://valis.cs.uiuc.edu/~sariel/research/papers/00/diameter/ > diam_prog.html > > For a description of the algorithm, see > http://valis.cs.uiuc.edu/~sariel/research/papers/98/bbox.html > > Sariel and Gill's paper also includes a description of several > commonly-used heuristics, none of which is guaranteed to be very good, > although most of them are decent in practice. I believe it's generally acknowledged by practitioners that fitting an oriented bounding box by principal component analysis or some other measurement of spread (as done in the above paper) gives a rather poor OBB fit. The best practical approach is to simply search the space of box orientations in a brute-force, hill-climbing like manner. That is, parameterize the orientation space using, say, Euler angles. Search in increments of n degrees. Then refine the area around the best fitting box by searching in increments of n/k degrees. Rinse and repeat until you've reached a (local) maximum. Christer Ericson Sony Computer Entertainment, Santa Monica ------------- 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 maftosmis at mail.arc.nasa.gov Fri Oct 3 16:30:06 2003 From: maftosmis at mail.arc.nasa.gov (Michael J. Aftosmis) Date: Mon Jan 9 13:41:12 2006 Subject: Plane-AABB Intersection. In-Reply-To: <1065150526.2322.5.camel@shunya.ctfd.nal.res.in> Message-ID: <23F5BA68-F5F1-11D7-B8EC-0003935484D2@mail.arc.nasa.gov> I don't know if I agree with your assessment that actually doing the clipping and computing the volume is "overkill" in 3D. There are very effecient algorithms to do it. If you think of your AABB as a coordinate aligned clipping window you can use a sutherland-hodgeman algorithm to do it. We do this all the time in Cart3D. (http://www.nas.nasa.gov:~aftosmis/cart3d/). Even doing all the clipping in software, its not hard to code this so that you can generate 2-10 million clipped polyhedra per minute, getting all the volumes, volume centroids, face areas, and face centroids along the way. If you're intent on an approximate method, there are some "volume-of-fluid" approaches from LLBL that may be of interest to you. Perhaps one of them will join the discussion. -Michael ------------- 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 suresh at research.att.com Fri Oct 3 19:31:40 2003 From: suresh at research.att.com (Suresh Venkatasubramanian) Date: Mon Jan 9 13:41:12 2006 Subject: OBB algorithm In-Reply-To: References: Message-ID: On Fri, 3 Oct 2003 christer_ericson@playstation.sony.com wrote: > Jeff Erickson wrote on 09/30/2003 08:18:51 AM: > > I believe it's generally acknowledged by practitioners that > fitting an oriented bounding box by principal component analysis > or some other measurement of spread (as done in the above paper) > gives a rather poor OBB fit. > > The best practical approach is to simply search the space of box > orientations in a brute-force, hill-climbing like manner. That is, > parameterize the orientation space using, say, Euler angles. Search > in increments of n degrees. Then refine the area around the best > fitting box by searching in increments of n/k degrees. Rinse and > repeat until you've reached a (local) maximum. > If you have code that does this well, I'd be curious to take a look at it. At the risk of tooting my own horn, we have a paper at this year's ESA that among other things computes oriented bounding boxes (the conf version doesn't go into this in detail, but in our full version we do experiments on computing OBBs). Our approach uses graphics cards to do the computation: it compares efficiency wise to the code by Sariel and Gil, and also fits well into the framework of search-and-zoom (I can give more details via email if anyone is interested). The paper is: Streaming Geometric optimization in graphics hardware P.Agarwal, S. Krishnan, N. Mustafa, and S. Venkatasubramanian Suresh Venkatasubramanian, Ph: 973 360 8951 (o) Member, Technical Staff Web: http://www.research.att.com/~suresh/ AT&T Shannon Labs I made a killing in the stock market once, but the only casualty was my investment - Frank & Ernest 7/8/00 ------------- 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 josy at ctfd.cmmacs.ernet.in Sat Oct 4 12:40:41 2003 From: josy at ctfd.cmmacs.ernet.in (Josy P. Pullockara) Date: Mon Jan 9 13:41:12 2006 Subject: Plane-AABB Intersection. In-Reply-To: <23F5BA68-F5F1-11D7-B8EC-0003935484D2@mail.arc.nasa.gov> References: <23F5BA68-F5F1-11D7-B8EC-0003935484D2@mail.arc.nasa.gov> Message-ID: <1065247841.2309.54.camel@shunya.ctfd.nal.res.in> On Sat, 2003-10-04 at 04:00, Michael J. Aftosmis wrote: > I don't know if I agree with your assessment that actually doing the > clipping and computing the volume is "overkill" in 3D. Actually, I follow your work (VKI lectures and others) closely. It is a pleasure to receive a reply from you. I agree that in practise it may not be an overkill but I "felt" it "may" be in principle :) > There are > very effecient algorithms to do it. If you think of your AABB > as a coordinate aligned clipping window you can use a > sutherland-hodgeman algorithm to do it. We do this all the time in > Cart3D. > (http://www.nas.nasa.gov:~aftosmis/cart3d/). Even doing all the clipping > in software, its not hard to code this so that you can generate 2-10 > million > clipped polyhedra per minute, getting all the volumes, volume > centroids, face areas, and face centroids along the way. Before embarking on the above method described by you in your publications I wanted to make sure I was not missing other methods that can just give me volume and area fractions as the two objects (box and plane) involved are quite simple! (simple - relatively) > If you're intent on an approximate method, there are some > "volume-of-fluid" approaches from LLBL that may be of interest to > you. Perhaps one of them will join the discussion. Do you or others use exact sub-cell information in practise for computing flows? Since, researchers like Colella, Berger, LeVeque and others do not "seem" to use sub-cell information, I thought it was not required to have sub-cell information. I thought it is a general practise to approximate the intersection by a line/plane. Thank you very much for your kind suggestions. I will go ahead and implement the clipping algorithms. I hope some mathematician will not come up with a proof "it is impossible to obtain the volume fractions without computing the polytopes" :P -- Josy P. Pullockara National Aerospace Laboratories, INDIA. ------------- 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 kimy at ewha.ac.kr Sat Oct 11 17:08:31 2003 From: kimy at ewha.ac.kr (Young J. Kim) Date: Mon Jan 9 13:41:12 2006 Subject: [Q] Surface tessellation bounding the original surface? Message-ID: <000901c38fc6$7a900020$422393dd@KIMS> Dear comp geometers: Is there anybody who has heard about a surface tessellation method that bounds the given, parametric surface? In other words, the given surface should be always enclosed inside the tessellation. Moreover, my surface can include non-rational terms including trigonometric functions. I will appreciate it if somebody can tell me any pointers to earlier work on this issue. 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. From skala at kiv.zcu.cz Fri Oct 3 16:57:07 2003 From: skala at kiv.zcu.cz (Vaclav Skala) Date: Mon Jan 9 13:41:12 2006 Subject: WSCG2004[3] - CfP Reminder - Plzen(Prague) Czech Rep. Message-ID: <003401c389b6$9ebac7c0$4e3fe493@fav.zcu.cz> To: compgeom-announce@research.bell-labs.com Monday, September 29, 2003 Dear friend, please, find the Reminder of WSCG 2004 Call for Papers useful for you and colleagues of yours. We had to extend the deadline for submission to October 16, as our server was out of order for a longer time due to new user identification system - we are extremely sorry about it. We are extremely sorry if you have got a duplicate due to some reasons. Yours Vaclav Skala, Univ.of West Bohemia, Czech Republic http://herakles.zcu.cz skala@kiv.zcu.cz ---------------- Call for Papers ---------------- >>>> Deadline extended to October 16, 2003 <<< { Please, forward it to colleagues of yours } W S C G ' 2004 February 2 - 6, 2004 http://wscg.zcu.cz (formerly the Winter School of Computer Graphics) The 12-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2004 in co-operation with EUROGRAPHICS to be held at the University of West Bohemia, Plzen, close to Prague - the Golden European City, Czech Republic Honorary Chair: Tosiyasu L. Kunii, Kanazawa Institute of Technology, Tokyo Programme Co-Chairs Roberto Scopigno, ISTI - CNR, Pisa, Italy Vaclav Skala, University of West Bohemia, Czech Republic Keynote speakers Tosiyasu L. Kunii: Cyber Graphics, Kanazawa Institute of Technology, Tokyo Carol O'Sullivan: Fidelity Matrics for Animation, Trinity College Dublin, Ireland Penny Rheingans: Artistically-inspired Visualization, Univ.of Maryland Baltimore, USA Extended deadline for uploading files: October 16, 2003 24:00 GMT (London time) The International Program Committee and Reviewing Board members review all papers peer-to-peer carefully and anonymously. Accepted papers and posters will be published in proceedings with ISBN Selected full papers will be published in The Journal of WSCG Vol. 12, ISSN 1213-6972 Information for authors Deadline for contributions: October 16, 2003 24:00 GMT (London time) -------------------------------------------------------------------- Format A4 (strictly), max. 8 pages, additional material up to 5 MB (video as MPEG, AVI and similar files, color plates etc. can be submitted, please, no video tapes) For details, please, see http://wscg.zcu.cz select WSCG'2004 Topics included Computer graphics and scientific visualization, computer vision, image processing and pattern recognition, fundamental algorithms and computational geometry, graphical human computer interface and graphical interaction, geometric modeling and computer aided geometric design, rendering and virtual reality, animation and multimedia, medical imaging, object oriented graphics, WWW technologies, parallel and distributed graphics, CAD/CAM, DTP systems GIS systems and Geoinformatics, applications and related fields. Proceedings are indexed/abstracted in: ISI, Inspec (IEE) and others. Organizer Prof.Vaclav Skala http://wscg.zcu.cz c/o Computer Science Department University of West Bohemia, Univerzitni 8, Box 314, CZ 306 14 Plzen, Czech Republic e-mail: skala@kiv.zcu.cz Subject: INFO WSCG 2004 tel./fax: +420-37-763-2457 Conference office UNION Agency, Na Mazinach 9, CZ 322 00 Plzen, Czech Republic ------------- 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 thill at tomotherapy.com Thu Oct 16 16:04:21 2003 From: thill at tomotherapy.com (Ted Hill) Date: Mon Jan 9 13:41:12 2006 Subject: Point Reduction / Line Generalization Message-ID: <1E2E66102E75104D8C740340EBCD98675FDE3E@tomoex.tomotherapy.com> I am looking for an algorithm to reduce the number of points for a simple 2D closed shape. Thank you, Ted Hill -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20031016/06b75a99/attachment.htm From farhad at cs.unt.edu Thu Oct 16 20:06:51 2003 From: farhad at cs.unt.edu (Farhad Shahrokhi) Date: Mon Jan 9 13:41:12 2006 Subject: Geometry Day at UNT Message-ID: <20031017000651.891593002@simin.csci.unt.edu> The University of North Texas will host a one-day conference on Saturday, October 25, 2003. The focus of GEOMETRY DAY would be on discrete geometry, computational geometry and graph theory. The preliminary version of the program is available at http://www.cs.unt.edu/geometryday The key note speech would be given by Professor Janos Pach of the City College (CUNY) and Renyi Institute. The invited talks would be given by Professors Pankaj Agarwal (Duke), Michal Karonski (Adam Mickiewicz and Emory) and Godfried Toussaint (McGill). The number of participants would be kept to about 40, to allow opportunities for discussions and interactions among them. The conference has been supported by the National Science Foundation. For information contact: Professor FARHAD SHAHROKHI Department of Computer Science & Engineering University of North Texas P.O. Box 311366, Denton, TX 76203 Phone: (940) 565 - 2805; Fax: (940) 565 - 2799 e-mail:farhad@cs.unt.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 hbr at poly.edu Fri Oct 17 19:22:44 2003 From: hbr at poly.edu (Herve Bronnimann) Date: Mon Jan 9 13:41:12 2006 Subject: SoCG 2004 Call for Papers Message-ID: <20031017222243.GB24784@geometry.poly.edu> CALL FOR PAPERS, VIDEO AND MULTIMEDIA http://socg.poly.edu/CFP.htm ACM Symposium on Computational Geometry June 9 - 11, 2004 Polytechnic University, Brooklyn, NY Sponsored by ACM SIGACT and SIGGRAPH http://socg.poly.edu/ The Twentieth Annual Symposium on Computational Geometry, featuring both theoretical and applied research, and a video/multimedia review, will be held at the Polytechnic University, Brooklyn, NY. We invite high-quality submissions based on research into geometric algorithms and data structures, into their implementation, into the supporting mathematics, and into application in computer graphics, computer-aided design and manufacturing, computational biology, geographic information systems, medicine, robotics, mathematics, databases, and other areas. The Program Co-Chairs have assembled a committee spanning both theoretical and applied interests in computational geometry to continue the tradition of encouraging submissions of theoretical, applied, or experimental nature to the conference. Topics of theoretical nature include, but are not limited to, design and theoretical analysis of geometric algorithms and data structures; lower bounds for geometric problems; and discrete and combinatorial geometry. Topics of applied and experimental nature include, but are not limited to mathematical and numerical issues arising from implementations, experimental analysis of algorithms and data structures, and novel uses of computational geometry in other disciplines. The accepted papers will be published by ACM in the symposium proceedings, which will be distributed to symposium participants, and available from ACM for purchase or through the digital library. A selection of papers from the conference will be invited to a special issue of Discrete and Computational Geometry. We encourage the submission of papers supported by multimedia or video presentations. Supporting presentations will be automatically considered as a submission to the multimedia/video track, unless the authors request otherwise. Supporting material also counts favorably in the paper review process. PAPER SUBMISSION Electronic submissions to www.cs.unc.edu/SCG04 in pdf or postscript are preferred. (For files over 5Mb, please contact one of the program chairs.) Authors may instead mail an extended abstract to either of the Program Co-Chairs, to arrive by December 12, 2003. Jean-Daniel Boissonnat Jack Snoeyink INRIA Sophia Antipolis Dept. of Computer Science 2004 route des Lucioles, BP 93 University of North Carolina at Chapel Hill 06902 Sophia Antipolis, France Chapel Hill, NC 27599-3175, USA Phone: +33 4 92 38 77 60 Phone: +1 (919) 962-1969 Jean-Daniel.Boissonnat@inria.fr snoeyink@cs.unc.edu IMPORTANT DATES December 12, 2003: Papers due February 8, 2004: Video and Multimedia submissions due February 15, 2004: Notification of acceptance or rejection for papers February 25, 2004: Notification for video/MM submissions March 15, 2004: Camera-ready papers and video/MM abstracts due April 5, 2004: Final versions of video/MM presentations due June 9-11, 2004: Symposium in New York SUBMISSION GUIDELINES Papers should be submitted in the form of an extended abstract, which begins with the title of the paper, each author's name, affiliation, and e-mail address, followed by a succinct statement of the problems and goals that are considered in the paper, the main results achieved, the significance of the work in the context of previous research, and a comparison to past research. The abstract should provide sufficient detail to allow the program committee to evaluate the validity, quality, and relevance of the contribution. The entire extended abstract should not exceed 10 pages, using 11 point or larger font and with at least one-inch margins all around. If the authors consider it absolutely essential to include additional technical details that do not fit into 10 pages, these details may be added in a clearly marked appendix that should appear after the body of the paper and the references; this appendix will not be regarded as a part of the submission and will be considered only at the program committee's discretion. Abstracts in electronic form or hard copy must be received before the end of December 12, 2003 (Honolulu time). Late submissions will not be considered. Authors will be notified of acceptance or rejection by February 15, 2004. A full version of each contribution in final form will be due by March 15, 2004 for inclusion in the proceedings. LaTeX style files for preparing the final version of the camera-ready paper can be downloaded from http://www.acm.org/sigs/pubs/proceed/template.html. (You may also wish to see this package from Jeff Erickson: http://www.cs.uiuc.edu/~jeffe/pubs/tex/fixacm.sty) CONFERENCE LOCAL ARRANGEMENTS Herve Bronnimann, John Iacono, Yi-Jen Chiang, and Boris Aronov Computer Science Dept, Polytechnic University Six Metrotech Center, Brooklyn, NY 11201 (socg04@socg.poly.edu) PROGRAM COMMITTEE Oswin Aichholzer (TU Graz) Sunil Arya (Hong Kong UST) David Avis (McGill University) Gill Barequet (The Technion-IIT) Bernard Chazelle (Princeton) Jean-Daniel Boissonnat (co-chair; INRIA Sophia Antipolis) Bernd Gaertner (ETH Zurich) Lydia Kavraki (Rice University) Peter Lindstrom (Lawrence Livermore National Labs) Anna Lubiw (University of Waterloo) Jack Snoeyink (co-chair; UNC Chapel Hill) Kokichi Sugihara (Tokyo University) CALL fOR VIDEO AND MULTIMEDIA PRESENTATIONS Video and multimedia presentations are sought for a video review of computational geometry. This review showcases the use of visualization in computational geometry for exposition and education, for the visual exploration of geometry in research, and as an interface and a debugging tool in software development. Algorithm animations, visual explanations of structural theorems, descriptions of applications of computational geometry, and demonstrations of software systems are all appropriate. Videos that accompany papers submitted to the technical program committee are encouraged. Three to five minutes is ideal for most animations and presentations of applications; eight minutes is the upper limit. Standard VHS videotape is allowed, but electronic formats are encouraged (QuickTime, MPEG, .avi, .mov, or RealPlayer). We allow submission of Macromedia Flash, MS PowerPoint animations, Java applets, and limited forms of other multimedia. These formats must have a 'demo mode' that requires no interaction after e.g. pressing a 'demo' button. In case of doubt, please email the Video and Multimedia Program chair. Accepted video and multimedia presentations will be collected and made available online in various formats in a web proceedings. VIDEO/MULTIMEDIA SUBMISSION We encourage the submission of papers supported by multimedia or video presentations. Supporting presentations will be automatically considered as a submission to the multimedia/video track, unless the authors request otherwise. Video and multimedia presentations can also be submitted separately, to arrive by February 8, 2004. For electronic submission of a video or multimedia presentation, the author(s) should submit a one or two-page description of the material shown in the presentation, and where applicable, the techniques used in the implementation, to the Video Review section of the electronic submission server www.cs.unc.edu/scg04. An email address of the correspondence author and a URL or ftp address where the presentation can be retrieved must be included. Additional material describing the contents of the presentations, such as the full text of accompanying papers, may also be included. The final descriptions must be formatted according to the guidelines for ACM proceedings. As an alternative, descriptions and videos on VHS videotape, in either NTSC or PAL format, can be sent to the video and multimedia presentations program chair, to arrive by February 8, 2004: Remco Veltkamp Institute of Information and Computing Sciences PO Box 80 089 3508 TB Utrecht, The Netherlands Phone: +31-30-253 4091 Remco.Veltkamp@cs.uu.nl For more information, please visit the web page http://www.cs.uu.nl/people/remcov/SoCG04multimedia/ NOTIFICATION Authors will be notified of acceptance or rejection, and given reviewers' comments by February 25, 2004. For each accepted presentation, the final version of the textual description will be due by March 15, 2004 (preferably electronically) for inclusion in the proceedings. Final versions of accepted presentations will be due April 5, 2004 in the best format available. VIDEO AND MULTIMEDIA PRESENTATION PROGRAM COMMITTEE Remco Veltkamp (chair; Utrecht University) Erik Demaine (MIT) Christian Knauer (Free University Berlin) Rene van Oostrum (Utrecht University) Mark Overmars (Utrecht 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 jjjjcrack at yahoo.com.cn Wed Oct 22 20:41:43 2003 From: jjjjcrack at yahoo.com.cn (=?gb2312?q?f=20f?=) Date: Mon Jan 9 13:41:12 2006 Subject: Ask for help Message-ID: <20031022114143.1188.qmail@web15206.mail.bjs.yahoo.com> Dear Sirs: In my paper for revision, I need the followed reference in urgent.Will anyone in your convience help me to find it. Feito F R,J C Torres. A Urena: Orientation, simplicity, and inclusion test for planar polygons. Computer & Graphics,1995,19(4):595-600. Feito F R, J C Torres. Inclusion test for general polyhedra. Computer & Graphics,1997, 21(1):23-30. Thank you very much! Ding jian(jjjjcrack@yahoo.com.cn) __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com ------------- 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 frankst at cs.uu.nl Fri Oct 24 17:16:10 2003 From: frankst at cs.uu.nl (Frank van der Stappen) Date: Mon Jan 9 13:41:12 2006 Subject: WAFR 2004 Call for Papers Message-ID: <5.1.1.6.0.20031024161120.03132dd8@imaps.cs.uu.nl> Call for Papers (Deadline: February 13, 2004) WAFR 2004 Sixth International Workshop on Algorithmic Foundations of Robotics July 11-13, 2004 Hotel Figi Utrecht/Zeist, The Netherlands Robot algorithms are abstractions of computational processes that control or reason about motion and perception in the physical world. 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. The Workshop on the Algorithmic Foundations aims to bring together a group of about sixty researchers to discuss recent trends and important future directions of research on the algorithmic issues related to robotics and automation. The workshop proceedings will be published in a hard-cover volume. Topics of interest include, but are not limited to, motion planning: - holonomic planning - nonholonomic planning - navigation manufacturing: - assembly - grasping and fixturing - manipulation robot design: - mimimalist robots - underactuated robots - modular and reconfigurable robots robot vision: - simultaneous location and mapping - sensor-based planning distributed manipulation foundations: - geometric algorithms - complexity and completeness - controllability applications: - computational molecular and structural biology - virtual environments and games - surgery planning - geographic information systems - simulation, animation, and graphics Program Committee Karl B?hringer Greg Chirikjian Yan-Bin Jia Oussama Khatib Rolf Klein Steven LaValle Ming Lin Kevin Lynch Mark Moll Nancy Pollard Elon Rimon Thierry Sim?on Jack Snoeyink Michael Yu Wang Conference Co-Chairs: Michael Erdmann, me@cs.cmu.edu David Hsu, dyhsu@comp.nus.edu.sg Mark Overmars, markov@cs.uu.nl Frank van der Stappen, frankst@cs.uu.nl Authors are invited to submit papers in PDF format by February 13, 2004 (see the website www.wafr.org for details). Authors will be notified of acceptance by May 7, 2004. Revised papers will be due by June 4, 2004. For more information, links to past WAFR conferences and papers, submission and registration details, hotel information etc, please visit the Conference Home Page: http://www.wafr.org ------------- 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 fanginc at gte.net Fri Oct 24 12:30:53 2003 From: fanginc at gte.net (Ben Fang) Date: Mon Jan 9 13:41:12 2006 Subject: New high-dimension interpolation method Message-ID: <002101c39a5c$f82cf330$db088844@yourav9l904ire> To those who are interested in "interpolation" for any dimensions (1D, 2D, 3D,......). We have good news to you. To date, there are no existing publications regarding interpolation methods that can be deduced analytically and extended easily to arbitrary dimensions. In fact, there is no publication for interpolation greater than 5-dimension. Based on the standard Monte-Carlo method as well as the Dirac delta function, we are able to "derive" an interpolation formulation which is good in any dimension. Please check our site for more info and demo at: http://www.fanginc.com/main.htm Feedback is welcome. Dr. Ben Fang FANG, INC. fanginc@gte.net -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20031024/45e3d3e7/attachment.htm From sc_bio_wang at hotmail.com Mon Oct 27 15:06:44 2003 From: sc_bio_wang at hotmail.com (Lipo Wang) Date: Mon Jan 9 13:41:12 2006 Subject: Call For Papers : Soft Computing For Bioinformatics ( SPRINGER) Message-ID: SOFT COMPUTING Journal - SPRINGER Special Issue on Soft Computing for Bioinformatics CALL FOR PAPERS The past few years have witnessed phenomenal growth of bioinformatics, an exciting field devoted to the interpretation and analysis of biological data using computational techniques. Among the large number of computational techniques used, soft computing, which incorporates * neural networks, * evolutionary computation, * fuzzy systems, and * chaos, stands out because of its demonstrated strength in handling imprecise information and providing novel solutions to hard problems. This special issue aims at not only showcasing innovative applications of soft computing techniques to bioinformatics, but also clarifying outstanding issues for future progress. Biological areas of interest include but are not limited to the following: * protein structure and function, * genomics, * proteomics, * molecular sequence analysis, * evolution and phylogenetics, * molecular interactions and structure, * gene expression, * metabolic pathways, * regulatory networks, * developmental control and systems biology. Papers should be submitted in PDF format via email to any of the following guest editors by 30 March 2004: * David Corne (D.W.Corne@exeter.ac.uk) * Gary Fogel (gfogel@natural-selection.com) * Jagath C. Rajapakse (asjagath@ntu.edu.sg) * Lipo Wang (elpwang@ntu.edu.sg) Please include title/abstract and author contact information in text format in the email. More information about the Soft Computing journal, such as Instructions for Authors, may be found at http://link.springer.de/link/service/journals/00500/index.htm _________________________________________________________________ Keep track of Singapore & Malaysia stock prices. http://www.msn.com.sg/money/ ------------- 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 frank at dehne.net Sun Oct 26 18:50:17 2003 From: frank at dehne.net (Prof. Frank Dehne (http://www.dehne.net)) Date: Mon Jan 9 13:41:12 2006 Subject: ALGORITHMICA Special Issue on Coarse Grained Parallel Algorithms For Scientific Applications Message-ID: <200310262351.h9QNpgUJ023194@ccs.carleton.ca> _________________________________________________________________________ CALL FOR PAPERS ALGORITHMICA Special Issue on Coarse Grained Parallel Algorithms For Scientific Applications Guest Editor Frank Dehne Overview: Parallel algorithms have become a standard tool for scientific applications. Many hard scientific computations would be impossible to perform without the use of parallel computers. This Special Issue of Algorithmica is dedicated to the design, implementation, and experimental evaluation of coarse grained parallel algorithms for scientific applications. Topics of Interest Include: - coarse grained parallel algorithms in computational molecular biology - coarse grained parallel algorithms in scientific simulations - coarse grained parallel algorithms in computational fluid dynamics - coarse grained parallel algorithms in geographic information systems - coarse grained parallel algorithms in large scale data analysis - coarse grained parallel algorithms in data mining and on-line analytical processing Paper Submission: Please send a PDF file of your paper via email to Frank Dehne, http://www.dehne.net, e-mail: frank@dehne.net Submission Deadline: February 27, 2004 _________________________________________________________________________ Website for this Special Issue: http://Algorithmica.Dehne.Net _________________________________________________________________________ ------------- 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 marianoroce at central.adzu.edu.ph Wed Oct 29 13:36:37 2003 From: marianoroce at central.adzu.edu.ph (marianoroce@central.adzu.edu.ph) Date: Mon Jan 9 13:41:12 2006 Subject: ph.d math Message-ID: <3F9FC264.20092.C9D0FF@localhost> To whom it may concern: Peace. We are graduates of Masters in Mathematics in the Philippines and are seeking for any scholarships, fellowships or assistance for Ph. D in Mathematics or Statistics. We would be very grateful if you provide us some. Thank you very much. Sincerely, Rochelleo E. Mariano Master of Education major in Math Ateneo de Zamboanga University Email add: marianoroce@central.adzu.edu.ph or untouched_84@yahoo.com Dante V. Partosa Master of Science in Teaching Mathematics Ateneo de Zamboanga University Email ad: partosadanv@central.adzu.edu.ph or dante1213@yahoo.com ------------- 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 Thu Oct 30 09:26:16 2003 From: jsbm at ams.sunysb.edu (jsbm@ams.sunysb.edu) Date: Mon Jan 9 13:41:12 2006 Subject: Important memo from NSF to computational geometers Message-ID: <200310301418.h9UEIjA24696@catbert.ams.sunysb.edu> [I am passing along a memo from NSF forwarded to me as a member of the Steering Committee. The Nov 5 deadline for GSGNR is no longer relevant; a new deadline will be announced (for a date in early 2004). Joe] Dear Colleagues: As you have no doubt already heard, the CISE Directorate is in the throws of a major reorganization. DON'T PANIC!! Graphics, Symbolic, Geometric, and Numeric Research will be supported in the new CISE but the disciplinary program, Graphics, Symbolic and Geometric Computing, will no longer exist. Rather, we will become part of a new cluster called FORMAL AND MATHEMATICAL FOUNDATIONS (FMF). This cluster is within the DIVISION OF COMPUTING AND COMMUNICATIONS FOUNDATIONS. For detailed descriptions of the new clusters (the replacements for programs, CISE-wide), check the CISE website periodically. Various (old) programmatic deadlines for the FNF cluster have been announced. IGNORE THEM. The new deadline will be well into FEBRUARY with the usual 1-month window for proposal submissions. The specific cluster and topic codes, etc., will be on FastLane to help get your proposal to the right spot in the cluster. On November 3, 2003, all of the aforementioned changes will take place. There will be new Divisions and clusters within CISE, but CISE's mission will not change. Why have we elected to change the CISE structure? If you haven't read Peter Freeman's slides on the web - http://www.cise.nsf.gov/news/cise_all_hands_meeting_files/frame.htm - it is instructive to do so now. From our vantage point, the new structure should dramatically improve the way we conduct our business. Once again, stay tuned and don't worry. Bob, John, and Xiaodong Dr. Robert Grafton Dr. John Staudhammer Dr. Xiaodong Zhang ------------- 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.