From shadi_792001 at yahoo.com Fri Jan 2 20:49:40 2004 From: shadi_792001 at yahoo.com (shadi nilforoushan) Date: Mon Jan 9 13:41:13 2006 Subject: Reach ability of 3-link robot arms Message-ID: <20040103044940.84221.qmail@web20309.mail.yahoo.com> Dear sir, I am a PhD. student in Algebraic Geometry.The field that I have to work is Robotic.I have a question about reach ability problems for designing 3-link arms in convex polygons.I don't know if there is anyone that has been worked on it,and if there is ,what is the new results ? I would appreciate if you help me with this subject. My mail is : shadi_792001@yahoo.com Sincerely, Zahra Nilforoushan. --------------------------------- Do you Yahoo!? Find out what made the Top Yahoo! Searches of 2003 -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20040102/bd6ad7d3/attachment.htm From fd at dehne.net Wed Jan 7 12:44:37 2004 From: fd at dehne.net ('Frank Dehne (http://www.dehne.net)') Date: Mon Jan 9 13:41:13 2006 Subject: Call For Papers: Parameterized and Exact Computation (IWPEC 2004) Message-ID: <200401071745.i07HjdTP008701@ccs.carleton.ca> _________________________________________________________________________ my apologies for multiple copies... _________________________________________________________________________ Call For Papers International Workshop on Parameterized and Exact Computation (IWPEC 2004) http://www.iwpec.org/ Bergen, Norway, September 14 - 17, 2004 co-located with ALGO 2004 (http://www.ii.uib.no/algo2004/) The International Workshop on Parameterized and Exact Computation, covers research in all aspects of parameterized and exact computation and complexity, including but not limited to: new techniques for the design and analysis of parameterized and exact algorithms, parameterized complexity theory, relationship between parameterized complexity and traditional complexity, applications of parameterized computation, implementation issues of parameterized algorithms, high-performance computing and fixed-parameter tractability. The goal is to present recent research results, including significant work-in-progress, and to identify and explore directions for future research. Submission Deadline: April 30, 2004 Notification: May 30, 2004 For more details, please consult http://www.iwpec.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 fd at dehne.net Tue Jan 6 16:09:46 2004 From: fd at dehne.net ('Frank Dehne (http://www.dehne.net)') Date: Mon Jan 9 13:41:13 2006 Subject: ALGORITHMICA Special Issue on Coarse Grained Parallel Algorithms For Scientific Applications Message-ID: <200401062111.i06LAnTQ006814@ccs.carleton.ca> _________________________________________________________________________ my apologies for multiple copies... _________________________________________________________________________ CALL FOR PAPERS ALGORITHMICA Special Issue on Coarse Grained Parallel Algorithms For Scientific Applications Guest Editor Frank Dehne (http://www.dehne.net) 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 Submission Deadline: February 27, 2004 For more details, please consult 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 luis_al_ma at yahoo.es Wed Jan 7 20:12:50 2004 From: luis_al_ma at yahoo.es (=?iso-8859-1?q?Luis=20Alma?=) Date: Mon Jan 9 13:41:13 2006 Subject: how to draw a polygon Message-ID: <20040107191250.32659.qmail@web25005.mail.ukl.yahoo.com> I want to be able to draw a closed polygon with a program in Visual C++ if possible. If not, any other programming language will be OK. I would like to be sent the code and an executable. Thanks, Luis --------------------------------- Antivirus #8226; Filtros antispam #8226; 6 MB gratis ?Todav?a no tienes un correo inteligente? -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20040107/88946688/attachment.htm From luis_al_ma at yahoo.es Fri Jan 9 11:31:52 2004 From: luis_al_ma at yahoo.es (=?iso-8859-1?q?Luis=20Alma?=) Date: Mon Jan 9 13:41:13 2006 Subject: drawing program Message-ID: <20040109103152.60285.qmail@web25004.mail.ukl.yahoo.com> Hi, i have to make a program able to draw polygons, circles, etc. Summary: It should allow me to paint a building floor (perimeter and contents).Could anyone give me a hand please? I mean: sending me something similar o recommend a place to find it. It would be nice if it allows me calculate distance, angles and so on. THANK YOU. By the way, does any of you know about building evacuation algorithm. --------------------------------- Antivirus #8226; Filtros antispam #8226; 6 MB gratis ?Todav?a no tienes un correo inteligente? -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20040109/fb1b7cf9/attachment.htm From rahban at ce.sharif.edu Wed Jan 14 11:56:53 2004 From: rahban at ce.sharif.edu (Mohammad Hossein Rohban) Date: Mon Jan 9 13:41:13 2006 Subject: Priority Search Tree Message-ID: <43741.62.112.172.9.1074099413.squirrel@ce.sharif.edu> Hi, There is a problem. We are given a number of intervals (all parallel to x-axis) and each with a given y in x-y plane. We are given a rectangular region specified by : (-infinity, x) * (y1, y2) and we want to find all intervals intersecting this region (not overlapping, both low and high points of desired intervals should not be in this region, only one of them.) Can we use a priority search tree (constructed on low end points of the intervals) to solve this problem in O(lg(n) + k), where k is the number of such intervals? Regards, Mohammad Hossein Rohban ------------- 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 Tue Jan 13 11:32:00 2004 From: frankst at cs.uu.nl (Frank van der Stappen) Date: Mon Jan 9 13:41:13 2006 Subject: WAFR 2004: Deadline February 13 Message-ID: <5.1.1.6.0.20040113112707.00ac8f20@imaps.cs.uu.nl> Call for Papers (Submission 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 -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20040113/aa361435/attachment.htm From marina at cpsc.ucalgary.ca Tue Jan 13 14:47:51 2004 From: marina at cpsc.ucalgary.ca (Marina Gavrilova) Date: Mon Jan 9 13:41:13 2006 Subject: CFP for International Workshop on Computational Geometry and Applications Message-ID: <002c01c3da1e$e4b447c0$0300a8c0@delphi> Hello, Could you please distribute the following CFP for CGA'04: 2nd CALL FOR PAPERS ============================================================ 4th International Workshop on Computational Geometry and Applications CGA'04 in conjunction with The 2004 International Conference on Computational Science and its Applications (ICCSA 2003) http://iccsa2004.unipg.it/ May 14, 2004 - May 17, 2004 Perugia, Italy Workshop Web Site: http://pages.cpsc.ucalgary.ca/~marina/Newweb/session.htm EXTENDED DEADLINE: JANUARY 21ST, 2004 ============================================================ Important Dates --------------- January 21, 2004: Extended deadline for paper submission. February 10, 2004: Notification of acceptance. February 15, 2004: Camera Ready Papers and Pre-registration. May 14 - 17, 2004: ICCSA 2004 Conference Invited Lecture --------------- Herve Bronnimann, (Polytechnic University, USA) Title: TBA Workshop Description -------------------- The Workshop, held for the fourth year in a row in conjunction with the International Conference on Computational Science and Its Applications, is intended as an international forum for researchers in all areas of computational geometry. Submissions of papers presenting a high-quality original research are invited to one of the two Workshop tracks: - theoretical computational geometry - implementation issues and applied computational geometry. Topics of interest: ----------------------- - Algorithmic methods in geometry - Animation of geometric algorithms - Lower bounds and algorithm complexity - Solid modeling - Geographic information systems - Computational methodology - Computer graphics and image processing - Illumination problems - Visibility graphs - Space Partitioning - Data structures (including Voronoi Diagrams and Delaunay triangulations) - Geometric computations in parallel and distributed environments - Mesh generation - Interpolation and surface reconstruction - Spatial and terrain analysis - Computer graphics and image processing - Computational methods in manufacturing - Applications in molecular biology, granular mechanics, computational physics, oceanography - Exact computations - Robotics - Path planning - Algorithm Implementation - CAD/CAM Submissions in other related areas will also be considered. The design and implementation of geometric algorithms in parallel and distributed environments, exact computations, and applications in mechanics, physics and biology, are of special interest. Proceedings ------------- Proceedings of the Workshop will be published in the Springer-Verlag Lecture Notes in Computer Science (LNCS) series. The proceedings will also be available separately for purchase from Springer-Verlag (proceedings of the previous Workshops on Computational Geometry and Applications appeared in LNCS vol. 2073, vol. 2329-2331). Papers from the Workshop may be invited to special issues of International Journal of Computational Geometry and Applications, Journal of CAD/CAM, Journal of Computational Methods in Sciences and Engineering (JCMSE) and the Journal of Supercomputing (pending agreement). Best Student Paper Award and Travel Grant ------------------------------------------ This year, a best student paper will be selected for a Best Student Paper Award. This award will be available exclusively to CGA'04 participants. A paper is eligible if at least one of its authors is a full or part-time student at the time of submission. Conference fees ---------------- For all details with respect to the conference fees please consult the ICCSA 2004 web page. Special discounts for students and participants from some academia/research institutions are available. For more information, please visit the Workshop web site. Submission ----------- We invite you to submit a draft of the paper of up to 10 pages (Letter or A4) paper. Please include a cover page (in ascii format) which lists the following: - Title of the paper - List of authors - name, affiliation, address and e-mail address of each author - name of the contact author - preferred track (theoretical or applied track) - a maximum of 5 keywords - intent to be considered for the Best Student Paper Award (exclusively for CGA'03 participants) - intent to apply for Travel Grant (available for all ICCSA'03 participants) The submission must be camera-ready and formatted according to the rules of LNCS. Electronic submissions in PS, PDF, or LaTex (please also submit all .eps, .dvi, and .ps files). MS Word submissions will also be accepted. Please submit your paper directly to e-mall address: marina@cpsc.ucalgary.ca Indicate in the header of the message "CGA'04 submission". Organizing Committee Conference Chairs: Vipin Kumar (Army High Performance Computing Center, USA and University of Minessota, USA) Honorary Chair Osvaldo Gervasi (University of Perugia, Italy) Marina Gavrilova (University of Calgary, Canada) Conference Co-Chair CGA'04 Program Committee (still being formed) Herve Bronnimann, (Polytechnic University, USA) Sergei Bespamyatnikh (University of Texas at Dallas, USA) Tamal Dey (Ohio State University, USA) Frank Dehne (Carleton University, Canada) Ovidiu Daescu (University of Texas at Dallas, USA) Christopher Gold (Hong Kong Polytechnic University) Deok-Soo Kim (Hanyang University, Korea) Andres Iglesias (University de Cantabria, Spain) Kokichi Sugihara (University of Tokyo, Japan) Vaclav Skala (University of West Bohemia, Czech Republic) Stephen Wismath (University of Lethbridge, Canada) J. A. Rod Blais (University of Calgary, Canada) Marian Bubak (AGH, Poland) Toni Cortes (Universidad de Catalunya, Barcelona, Spain) Brian J. d'Auriol (University of Texas at El Paso, USA) Ivan Dimov (Bulgarian Academy of Sciences, Bulgaria) Matthew F. Dixon (Heuchera Technologies, UK) Geoffrey Fox (Indiana University, USA) Marina L. Gavrilova (University of Calgary, Canada) Benjoe A. Juliano (California State University at Chico, USA) Vipin Kumar (University of Minnesota, USA) Antonio Lagana (Universit? Degli Studi di Perugia, Italy) Renee S. Renner (California State University at Chico, USA) Koichi Wada (University of Tsukuba, Japan) Roy Williams (California Institute of Technology, USA) Osman Yasar (SUNY at Brockport, USA) Chee Yap (New York University, USA) Zahari Zlatev (Danish Environmental Research Institute, Denmark) CGA'01, CGA'02 and CGA'03 profiles To view electronic proceedings of the CGA'01, follow the link to LNCS web site: http://turing.zblmath.fiz-karlsruhe.de/cs/www_lncs.1.html Volume 2073, Springer Verlag. Invited speaker for CGA'01: Kokichi Sugihara, University of Tokyo, Japan Invited speakers for CGA'02: Mark Overmars, Utrecht University Contributed Presentation: Pieter Huybers, the Netherlands Invited speakers for CGA'03: Chee Yap, New York University, USA Godfried Toussaint, McGill University, Canada List of papers appeared at CGA'01, CGA'02 and CGA'03 can be found on Workshop web site as well as in LNCS series. Selected papers from the previous workshops appeared in the special issue of the International Journal of Computational Geometry and Applcations (IJCGA), Volume 14, No 4, August 2003. Please direct any questions to: Marina L. Gavrilova CGA'04 Chair ICCSA'04 Co-Chair Department of Computer Science, University of Calgary, 2500 University Drive, Calgary, Alberta, Canada, T2N1N4 Telephone: (403) 241-6315 Fax: (403) 284-4707 E-mail: marina@cpsc.ucalgary.ca -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20040113/12bd940e/attachment.htm From fd at dehne.net Sun Jan 18 08:44:02 2004 From: fd at dehne.net ('Frank Dehne (http://www.dehne.net)') Date: Mon Jan 9 13:41:13 2006 Subject: CALL FOR WORKSHOP PROPOSALS: PARALLEL AND DISTRIBUTED COMPUTING SYSTEMS (PDCS-2004) Message-ID: <200401181345.i0IDj120002368@ccs.carleton.ca> CALL FOR WORKSHOP PROPOSALS 17th INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING SYSTEMS September 15-17, 2004 Canterbury Hotel, San Francisco, California, USA http://multimedia.ece.uic.edu/pdcs2004/ PDCS-2004 is a major forum to address, explore and exchange information on the state-of-the-art in all areas of Parallel and Distributed Computing Systems, their modeling and simulation, design, use and performance, and their impact. Topics include, but are not limited to, the following research areas: 1. Parallel Architectures and Systems - Multithreaded Architectures - Interconnection Networks - Application-Specific Parallel Architectures - Architectural Support for Fine-Grain Parallelism - Architectures for Distributed and Enterprise Systems - Reconfigurable Computing - Ubiquitous and Pervasive Computing - Network Processors and Sensor Networks - Peer-to-Peer Networks - Cluster and Grid Computing 2. Parallel and Distributed Algorithms - Partitioning, Mapping, and Scheduling - Routing, Communication, and Synchronization Techniques - Load Balancing and Load Sharing - Fault Tolerance and Replication Designs - Security, Naming, and Authentication - Resource Allocation and Management - Distributed Query Processing and Information Retrieval - Reliable Distributed Computing - Network Management Algorithms & Computer Networks Protocols - Real-Time & Embedded Distributed Algorithms & Systems 3. Parallel and Distributed Systems Software - Languages, Compilers, and Operating Systems - Libraries and Programming Environments - Message Passing and Distributed Shared Memory Paradigms - Software Development, Services, Support, Tools - Middleware for Parallel and Distributed Computing - Benchmarking and Measurements - Embedded Systems - Component- and Agent-Based Systems - Data Warehousing and Mining - Cooperative Information Systems 4. Parallel and Distributed Applications - Bioinformatics and Biocomputing - Scientific Computing - Distributed Multimedia Systems and Internet Applications - Grid and Internet Appliances - Personal Communication Networks and Systems - Broadband ISDN and ATM Systems - P & D Systems Integration - P & D Industrial and Manufacturing Application - Heterogeneity and Interoperability - Neural and Fuzzy Computing and Applications - Collaboration Enterprises and Environments Proposal for organizing one-day workshops on upcoming research areas are solicited and are due to the Workshop Chair Frank Dehne (http://www.dehne.net) by January 26, 2004. For more information about PDCS-2004, incl. Call For Papers, Venue, etc. please consult http://multimedia.ece.uic.edu/pdcs2004/ ------------- 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 rahban at ce.sharif.edu Tue Jan 20 08:56:27 2004 From: rahban at ce.sharif.edu (Mohammad Hossein Rohban) Date: Mon Jan 9 13:41:13 2006 Subject: Problem Message-ID: <50596.62.112.172.10.1074606987.squirrel@ce.sharif.edu> Hi, Consider this problem. A number of chords are given on a circle (each with length less than 3.14159*r). Give an O(n log n) algorithm to find minimum number of line segments (with the center of the circle as one of their end points and some other points on the circle as the other end points), that are necessary to cover all chords (by covering, I mean each chord has at least one intersection with a line segment.) I tried to solve this problem, and I have devised an algorithm which runs in O(n log n) time in cases that there exists a chord that contains no right point of any other chords (considering counterclockwise direction.) But of course this may not be happened in worst case and this cause the algorithm to run in O(n^2) time. Can anyone give an algorithm to solve this problem in O(n log n) time in its worst case? best regards, Mohammad Hossein Rohban ------------- 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 mburr at eecs.tufts.edu Tue Jan 27 21:52:19 2004 From: mburr at eecs.tufts.edu (mburr@eecs.tufts.edu) Date: Mon Jan 9 13:41:13 2006 Subject: Graph Embedding Message-ID: <1075258339.401723e34c317@webmail.eecs.tufts.edu> Hi, Does anyone know any work that has been done with isomorphisms of (nondegenerate) embeddings WITH crossings of complete graphs in the plane. As an example, with 4 points there are two equivalence classes of embeddings, the four points arranged in a convex quadrilateral (so there is one crossing in the complete graph) or three of the points arranged in a triangle and the forth in the triangle's interior (there are no crossings in this case). Thank you very much, Michael ------------------------------------------------- This mail sent through IMP: http://horde.org/imp/ ------------- 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 luis_al_ma at yahoo.es Fri Jan 23 14:57:06 2004 From: luis_al_ma at yahoo.es (=?iso-8859-1?q?Luis=20Alma?=) Date: Mon Jan 9 13:41:13 2006 Subject: relations between polygons. Message-ID: <20040123135706.3374.qmail@web25002.mail.ukl.yahoo.com> Is there any algorithm which allows me to find the relation (having points in common, being adyancent, intersection,one inside the other...) between 2 given polygons. Thanks --------------------------------- Antivirus #8226; Filtros antispam #8226; 6 MB gratis ?Todav?a no tienes un correo inteligente? -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20040123/25967dbd/attachment.htm