From haptex2005 at MIRALAB.UNIGE.CH Sat Jun 4 21:44:44 2005 From: haptex2005 at MIRALAB.UNIGE.CH (Haptex 2005 Workshop) Date: Mon Jan 9 13:41:19 2006 Subject: Call for Papers: HAPTEX =?windows-1252?Q?=9105_-_VR_Worksh?= =?windows-1252?Q?op?= Message-ID: <42A1F69C.7010200@miralab.unige.ch> Call for Papers =============== HAPTEX ?05 - VR Workshop On Haptic and Tactile Perception of Deformable Objects December 1-2, 2005 Leibniz Haus, Hanover, Germany University Of Hanover Important dates =============== Deadline for Submission: June 30, 2005 Notification of Acceptance: August 15, 2005 Deadline for Final Version: August 30, 2005 Within the frame of the EU-HAPTEX project the Welfenlab, University of Hanover organizes a workshop on haptic and tactile perception. All submissions will be peer reviewed. The most interesting contributions to the workshop will be published in a special issue of The Visual Computer after the workshop took place. For details concerning the workshop and the submission, please see: http://www.gdv.uni-hannover.de/haptex05 Topics of interest ================== ? Human-Computer Interaction ? Simulating the touch, the hearing and the vision in virtual worlds ? Multimodal interaction system for presenting deformable materials ? Presenting haptic feedback in multimodal interaction ? Hardware for haptic/tactile interaction in virtual worlds ? Haptic/tactile rendering ? Modeling dynamics of deformable objects for haptic/tactile feedback ? Dynamic simulation of soft tissues/deformable objects including textiles ? Perception of material using haptic feedback ? Applications of haptic/tactile interfaces for soft/deformable objects Program and Workshop Co-Chairs HAPTEX ?05 ========================================= Nadia Magnenat-Thalmann and Franz-Erich Wolter Program Commitee ================ Massimo Bergamasco, PERCRO Heinrich H. B?lthoff, MPI Tuebingen Antonio Bicchi, University of Pisa Martin Buss, TU-Munich Sabine Coquillart, INRIA Eddy Flerackers, University of Limburg Tobias H?llerer, University of California, Santa Barbara Hiro Iwata, University of Tsukuba Abderrahmane Kheddar, University of Evry Val d'Essonne Hyung Seok Kim, University of Geneva Tadashi Kitamura, Kyushu Institute of Technology Frederic Fol Leymarie, University of London Ming Lin, University of North Carolina Annie Luciani, INPG Nadia Magnenat-Thalmann, University of Geneva Harriet Meinander, University of Tampere Dimitris Metaxas, Rutgers University Dinesh Pai, University of North Carolina Fabio Salsedo, PERCRO Makoto Sato, Tokyo Institute of Technology Ian Summers, University of Exeter Hong Tan, Purdue University Daniel Thalmann, EPFL Frederic Vexo, EPFL Pascal Volino, University of Geneva Alan Wing, University of Birmingham Franz-Erich Wolter, University of Hanover Peter Wriggers, University of Hanover Contact ======= For more information, please contact: Web: http://www.gdv.uni-hannover.de/haptex05 Email: Guido B?ttcher Fax: +49 511 - 762 29 14 Guidelines for Submission to HAPTEX?05 ====================================== Workshop Proceedings The deadline for submitting the final version of your paper will be on the: 30th of June @ 11.59 CET Format: The format for final submission is detailed below ? if you have been successful in having more than one paper accepted please make sure you submit in the correct version. o Description of the required Template can be found here o The LaTeX Template can be found here o Example MS Word Document can be found here Submission: The following procedure must be observed in order that papers are published - All papers must be uploaded before 30th of June @ 11.59CET - Papers must be submitted as PDF Documents only - Figures and Diagrams should be at least of 300dpi resolution How to register and submit a paper for HAPTEX '05: First surf to the webpage http://www.gdv.uni-hannover.de/haptex05/conftool/, where you select the option Create new account in the middle of the page. You will then be presented a form where you have to fill in some personal information, such as name, address and email, which we need to contact you. The required fields are marked with an * asterisk. Under ?Account Information? you select a username and password, which should be easy to remember for you (in case you forget, you can always request a new one which will be sent to the email address you specified). If you would like to get the account information you entered as a reminder via email, you can tick the field below. Finally, you click the ?Submit User Data? button near the bottom of the page. If no errors occurred you are now logged in and can select between 3 options 1) Edit your personal information under User Data. 2) Submit a paper / poster to the workshop by clicking Submit Contribution. 3) Logout via Logout To submit your paper select the second option. You will see a formular where you fill in the necessary data about your contribution. If you have problems to find the right ?Topic? for your paper, just type in a little note in the ?Remark / Message to the Conference Chairs? textbox. Nevertheless, you have to select at least one of the topics. If you have filled out everything, click the ?Proceed? button. On the next page you can upload your paper to our server. Click the ?Browse? button and select the file you want to upload. When you have selected it, click the ?Upload File and Complete Submission? button. Pay attention to the format of the file. You can only upload files which are in PDF or Postscript format and compressed with ZIP or GZIP. Maximum file size is 10 MB. You can always upload another version of your paper or edit the information later. If everything went right, you're back to the Overview page, where you see your submission at the bottom. If your submission is reviewed, you will get a notice via email and can then log in to read details and see the review score. -------------- next part -------------- A non-text attachment was scrubbed... Name: HAPTEX_CFP.pdf Type: application/pdf Size: 69687 bytes Desc: not available Url : http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20050604/49e1ffb4/HAPTEX_CFP.pdf From bender at cs.sunysb.edu Thu Jun 9 06:46:10 2005 From: bender at cs.sunysb.edu (Michael Bender) Date: Mon Jan 9 13:41:19 2006 Subject: SPAA 2005 Call for Participation Message-ID: SPAA 2005 Call for Participation http://www.spaa-conference.org/ This is a reminder that the early-registration deadline for SPAA '05 (co-located with PODC) is on the 13th of June. Please register early to ensure regular registration fees. SPAA 2005 Conference Program: ============================= Sunday, July 17, 2005 6:00 - 9:00 pm : Reception Monday, July 18 7:30 - 8:20 am : Continental Breakfast 8:20 - 10:00 : Session 1: Queuing and Scheduling (Chair: TBA) Randomized Queue Management for DiffServ Nir Andelman Randomization does not Reduce the Average Delay in Parallel Packet Switches Hagit Attiya and David Hay Dynamic Circular Work-Stealing Deque David Chase and Yossi Lev Lexicographic QoS Scheduling for Parallel I/O Ajay Gulati and Peter Varman 10:00 - 10:30 : Coffee Break 10:30 - 12:10 : Session 2: Joint Session (Chair: TBA) Distance Estimation and Object Location via Rings of Neighbors Aleksandrs Slivkins Building Scalable and Robust Peer-to-Peer Overlay Networks for Broadcasting using Network Coding Kamal Jain, Laszlo Lovasz and Philip A. Chou Coloring Unstructured Radio Networks Thomas Moscibroda and Roger Wattenhofer Name Independent Routing for Growth Bounded Networks Ittai Abraham and Dahlia Malkhi 12:10 - 1:45 : Lunch 1:45 - 3:25 : Session 3: Scheduling (Chair: TBA) Windows Scheduling of Arbitrary Length Jobs on Parallel Machines Amotz Bar-Noy, Richard E. Ladner, Tami Tamir, and Tammy VanDeGrift Parallel Scheduling of Complex Dags under Uncertainty Grzegorz Malewicz On Distributed Smooth Scheduling Ami Litman and Shiri Moran-Schein Scheduling Malleable Tasks with Precedence Constraints Klaus Jansen and Hu Zhang 3:25 - 4:05 : Coffee Break 4:05 - 5:20 : Session 4: Sensor Networks and Ad Hoc Networks (Chair: TBA) An Adaptive Power Conservation Scheme for Heterogeneous Wireless Sensor Networks Ioannis Chatzigiannakis, Athanassios Kinalis and Sotiris Nikoletseas Irrigating Ad Hoc Networks in Constant Time D. Dubhashi, O. Haggstrom, C. Johansson, A. Panconesi and M. Sozio Constant Density Spanners for Wireless Ad-Hoc Networks Melih Onus, Kishore Kothapalli, Andrea Richa and Christian Scheideler 8:00 - 10:00 : Business Meeting Tuesday, July 19 7:30 - 8:20 am : Continental Breakfast 8:20 - 10:00 : Session 5: Peer-to-Peer Networks (Chair: TBA) The Expansion and Mixing Time of Skip Graphs with Applications James Aspnes and Udi Wieder Decentralized Algorithms using both Local and Random Probes for P2P Load Balancing Krishnaram Kenthapadi and Gurmeet Singh Manku Fast Construction of Overlay Networks Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu, and Yitong Yin Peer-to-Peer Networks based on Random Transformations of Connected Regular Undirected Graphs Peter Mahlmann and Christian Schindelhauer 10:00 - 10.40 : Coffee Break 10.40 - 11:40 : Invited Talk (Chair: TBA) TBA Elias Koutsoupias 11:40 - 1:45 : Lunch 1:45 - 3:25 : Session 6: Parallel and Quantum Algorithms (Chair: TBA) Processor Efficient Parallel Matching Piotr Sankowski Parallelizing Time with Polynomial Circuits Ryan Williams Finding Effective Support-Tree Preconditioners Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ravi, Shan Leung Maverick Woo Is Partial Quantum Search of a Database Any Easier? Lov K. Grover and Jaikumar Radhakrishnan 3:25 - 4:05 : Coffee Break 4:05 - 4:55 : Session 7: Game Theory (Chair: TBA) A Truthful Mechanism for the Non-Utilitarian Minimum Radius Spanning Tree Problem Guido Proietti and Peter Widmayer Selfish Routing with Incomplete Information Martin Gairing, Burkhard Monien and Karsten Tiemann 5:00 - 5:25 : Brief Announcements (Chair: TBA) A Segmented Parallel-Prefix VLSI Circuit with Small Delays for Small Segments Bradley C. Kuszmaul A Forward Planning Situated Protocol for Data Propagation in Wireless Sensor Networks based on Swarm Intelligence Ioannis Chtzigiannakis and Sotiris Nikoletseas Autonomous Virtual Mobile Nodes Shlomi Dolev, Seth Gilbert, Elad Schiller, Alex Shvartsman and Jennifer Welch A Space Lower Bound for Name-Independent Compact Routing in Trees Kofi A. Laing and Rajmohan Rajaraman On Competitive Online Read-many Parallel Disks Scheduling Rahul Shah, Peter J. Varman and Jeffrey Scott Vitter 6:00 - 11:00 : Banquet and Awards Ceremony Wednesday, July 20 7:30 - 8:20 am : Continental Breakfast 8.20 - 10.00 : Session 8: Algorithms and Data Structures (Chair: TBA) Weighted Distributed Hash Tables Christian Schindelhauer and Gunnar Schomaker Concurrent Cache-Oblivious Search Trees Michael A. Bender, Jeremey T. Fineman, Seth Gilbert and Bradley C. Kuszmaul Admission Control to Minimize Rejections and Online Set Cover with Repetitions Noga Alon, Yossi Azar and Shai Gutner Efficient Algorithms for Verifying Memory Consistency Chaiyasit Manovit and Sudheendra Hangal 10.00 - 10.30 : Coffee Break 10.30 - 12.10 : Session 9: Joint Session (Chair: TBA) Adaptive Routing with Stale Information Simon Fischer and Berthold Vöcking A Network Pricing Game for Selfish Traffic Ara Hayraptetyan, Eva Tardos and Tom Wexler Using Elimination to Implement Scalable FIFO Queues Mark Moir, Daniel Nussbaum, Ori Shalev and Nir Shavit Collaborate with Strangers to Find Own Preferences Baruch Awerbuch, Yossi Azar, Zvi Lotker, Boaz Patt-Shamir and Mark Tuttle 12:10 - 1:45 : Lunch 1:45 - 3:25 : Session 10: Miscellaneous (Chair: TBA) Dynamic Page Migration with Stochastic Requests Marcin Bienkowski Broadcasting in Networks of Workstations Samir Khuller, Yoo-Ah Kim and Yung-Chun (Justin) Wan Traffic Engineering of Management Flows by Link Augmentations on Confluent Trees Randeep S. Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Seffi Naor and Baruch Schieber Value-Maximizing Deadline Scheduling and its Application to Animation Rendering Eric Anderson, Dirk Beyer, Kamalika Chaudhuri, Terence Kelly, Norman Salazar and Cipriano Santos 3:25 - 3:45 : Coffee Break 3:45 - 5:00 : Session 11: Radio Networks (Chair: TBA) Radio Communication in Random Graphs Robert Elsaesser and Leszek Gasieniec Oblivious Routing in Geometric Networks Costas Busch, Malik Magdon-Ismail and Jing Xi Adversarial Contention Resolution for Simple Channels Michael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuzsmaul and Charles E. Leiserson ------------- 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 xgao at mmrc.iss.ac.cn Mon Jun 6 10:15:36 2005 From: xgao at mmrc.iss.ac.cn (Xiaoshan GAO) Date: Mon Jan 9 13:41:19 2006 Subject: SpecialIssue Message-ID: <200506060115.j561FaZ6028672@mmrc.iss.ac.cn> Under several requests for extension of deadline for submission, We have therefore extended the paper submission deadline to June 30, 2005. _____________________________________________________________ CFP: Geometric Constraints A special issue of International Journal of Computational Geometry and Applications _____________________________________________________________ Authors should send their submission as a file attachment in pdf or postscript format to both guests editors by June 30, 2005. Xiao-Shan Gao Institute of Systems Science, Academia Sinica, Beijing 100080 China Email: xgao@mmrc.iss.ac.cn http://www.mmrc.iss.ac.cn/~xgao Tel: 86-10-6254-1831 Fax: 86-10-6263-0706 Dominique Michelucci Laboratory Electroninics, Computer Science, Image Faculty sciences & techniques University of Burgundy BP 47870 21078 Dijon Cedex France Email: Dominique.Michelucci@u-bourgogne.fr Tel: 333.80.39.38.85 from abroad, 03.80.39.38.85 from France Fax: 333.80.39.59.10 from abroad, 03.80.39.38.85 from France Detailed CFP can be found at: http://www.mmrc.iss.ac.cn/~xgao/CFP-IJCGA.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 alopez-o at softbase.math.uwaterloo.ca Mon Jun 13 13:11:16 2005 From: alopez-o at softbase.math.uwaterloo.ca (Alex Lopez-Ortiz) Date: Mon Jan 9 13:41:19 2006 Subject: WADS'05 Call for participation (fwd) Message-ID: Early registration deadline: June 18, 2005 CALL FOR PARTICIPATION Workshop on Algorithms and Data Structures WADS 2005 August 15 - August 17, 2005 Univ. of Waterloo, Waterloo, Canada in conjunction with CCCG 2005, CAAN'05 and F-CWCA. The Workshop on Algorithms And Data Structures, WADS 2005, will be held August 15-17, 2005, at the University of Waterloo, in Waterloo, Ontario, Canada. WADS is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. The workshop includes papers presenting original research on algorithms and data structures in all areas, including combinatorics, computational geometry, databases, graphics, and parallel and distributed computing. Proceedings are published in the Springer Verlag series Lecture Notes in Computer Science. Immediately before WADS 2005, a satellite workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN 2005) will be held. As well, in coordination with WADS, the Canadian Conference on Computational Geometry (CCCG 2005) will take place on August 10-12 in the nearby city of Windsor, and the Franco-Canadian Workshop on Combinatorial Algorithms will take place on August 18-20, in nearby Hamilton, Ontario. WADS 2005 Invited Speakers: Allan Borodin, University of Toronto Max J. Egenhofer, National Center for Geographic Information and Analysis, University of Maine Further information: http://db.uwaterloo.ca/~alopez-o/WADS2005/default.htm http://www.wads.org/ -- Alex Lopez-Ortiz alopez-o@uwaterloo.ca http://db.uwaterloo.ca/~alopez-o Associate Professor School of Computer Science University of Waterloo ------------- 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 tie at nus.edu.sg Thu Jun 9 02:00:43 2005 From: tie at nus.edu.sg (Tie Luo) Date: Mon Jan 9 13:41:19 2006 Subject: common intersection of circles Message-ID: <907483416.20050609010043@nus.edu.sg> Hi, I am referring to your following email. Did you get answer? I know that email is quite old but I really also want to know the interesting result very much. Thanks! --------------------------------------------------------------------------- To: compgeom-discuss@research.bell-labs.com Subject: common intersection of circles From: Karthik Haridoss Date: Thu, 19 Sep 2002 14:51:25 -0500 (CDT) --------------------------------------------------------------------------- Hello computational poeople, I have 3 circles, with their centers and radius known. How would I compute the common area of intersection of the three circles. I am not sure if my three circles are intersecting at all. If they are intersection the area formula should give me the value of common area of intersection else it should return 0. Please advise in that manner.I did a brief search on NET and was able to find a sampling based method, which takes a point in random and sees is the point is in the common area and proceed accordingly. But I need a definitive formula based approach. Can you please provide me the formula common area of intersection of three circles. Also provide me links that has the software implementation of this problem. Please use this general equation of the circle (X-a)^2 + (Y-b)^2 = r^2. Where (a,b) is the center of that cicle and r is its radius. Thanks in advance. Happy day, Karthik _____________________________________________ Karthik Haridoss Research Assistant Dept. of Comp. Science Univ. of Texas at Dallas _____________________________________________ -- Regards, Tie 6/9/2005 ------------- 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 vd2005 at voronoi.hanyang.ac.kr Mon Jun 20 11:25:12 2005 From: vd2005 at voronoi.hanyang.ac.kr (VD2005) Date: Mon Jan 9 13:41:19 2006 Subject: 2nd CFP for VD2005 - Interational Symposium on Voronoi diagrams in Science and Engineering 2005 Message-ID: <200506200125.j5K1P96X008124@hoemail1.lucent.com> An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20050620/97824590/attachment.htm From HaasThomas at gmx.de Mon Jun 20 12:47:55 2005 From: HaasThomas at gmx.de (Thomas Haas) Date: Mon Jan 9 13:41:19 2006 Subject: questions on computational geometry Message-ID: <20280.1119260875@www57.gmx.net> Hallo everybody, does any one can suggest a good book about computational geometry where terms and problems like the following are explained: 1-skeleton isomorphic equivalence classes quotient space cutting of a surface along a curve I got this terms from the documentation of the visibility complex (from Pierre Angelier and Michael Pocchiola) package which is an extension to CGAL. I need them to understand the functionallity of it. Thanks Thomas -- Weitersagen: GMX DSL-Flatrates mit Tempo-Garantie! Ab 4,99 Euro/Monat: http://www.gmx.net/de/go/dsl ------------- 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.