From isaac98 at jupiter.kaist.ac.kr Tue Aug 4 14:55:06 1998 From: isaac98 at jupiter.kaist.ac.kr (ISAAC '98) Date: Mon Jan 9 13:40:54 2006 Subject: [ISAAC'98] Accepted Papers Message-ID: <19980804135506.A15012@jupiter.kaist.ac.kr> Below is a list of paper accepted to ISAAC'98 to be held in Taejon, Korea on December 14-16, 1998. More information can be obtained from the conference web site: http://tclab.kaist.ac.kr/~isaac98/ *************************************************************************** On-Line Scheduling of Parallel Jobs with Runtime Restrictions --- Stefan Bischof and Ernst W. Mayr Approximation algorithms for some optimum communication spanning tree problems --- Bang Ye Wu, Kun-Mao Chao, and Chuan Yi Tang Approximation and Exact Algorithms for {RNA} Secondary Structure Prediction and Recognition of Stochastic Context-free Languages --- Tatsuya Akutsu An optimal algorithm for on-line palletizing at delivery industry --- J. Rethmann and E. Wanke Generalized Self-Approaching Curves --- Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, and Guenter Rote A New Approach for Speeding Up Enumeration Algorithms --- Takeaki Uno Two New Families of List Update Algorithms --- Frank Schulz Two-Layer Planarization in Graph Drawing --- Petra Mutzel and Ren'e Weiskircher Randomized $O( log log n)$-Round Leader Election Protocols in Packet Radio Networks --- Koji Nakano and Stephan Olariu Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image --- Tetsuo Asano, Hiro Ito, Souichi Kimura, and Nariaki Shimazu Convertibility among Grid Filling Curves --- Tetsuo Asano, Naoki Katoh, Hisao Tamaki, and Takeshi Tokuyama Selecting the k Largest Elements with Parity Tests --- T.W. Lam and H.F. Ting Disjunctions of Horn Theories and their Cores --- Thomas Eiter, Toshihide Ibaraki, and Kazuhisa Makino Optimality and Integer Programming Formulations of Triangulations in General Dimension --- Akira Tajima Computing Orthogonal Drawings in a Variable Embedding Setting --- W. Didimo and G. Liotta Inapproximability results for guarding polygons without holes --- Stephan Eidenbenz Polyhedral Structure in Submodular and Posi-modular Systems --- Hiroshi Nagamochi and Toshihide Ibaraki The Edge-Disjoint Paths Problem is NP-Complete for Partial $k$-Trees --- Xiao Zhou and Takao Nishizeki Checking Programs Discretely: Demonstrating Result-Correctness Efficiently While Concealing It --- G.D. Crescenzo, K. Sakurai, , and M. Yung Dynamic Grid Embedding with Few Bends and Changes --- Ulrik Brandes and Dorothea Wagner Maximizing the Number of Connections in Optical Tree Networks --- Thomas Erlebach and Klaus Jansen A parallel algorithm for sampling matchings from an almost uniform distribution --- J. Diaz, J. Petit, P. Psycharis, and M. Serna Randomized $k$-Dimensional Binary Search Trees --- Amalia Duch, Vladimir Estivill-Castro, and Conrado Martinez On the inapproximability of non NP-hard optimization problems --- Liming Cai, David Juedes, , and Iyad Kanj Quadtree Decomposition, Steiner Triangulation, and Ray shooting --- Siu-Wing Cheng and Kam-Hing Lee Casting with Skewed Ejection Direction --- Hee kap Ahn, Siu-Wing Cheng, and Otfried Cheong An Efficient NC Algorithm for a Sparse $k$-Edge-Connectivity Certificate --- Hiroshi Nagamochi and Toru Hasunuma Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs --- Yaw-Ling Lin Space-efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs --- Philip N. Klein and Hsueh-I Lu On the Multiple Gene Duplication Problem --- Michael Fellows, Michael Hallett, and Ulrike Stege $L_\infty$ Voronoi Diagrams and Applications to VLSI Layout and Manufacturing --- Evanthia Papadopoulou Characterization of Efficiently Computable Problems on Distance-Hereditary Graphs --- Sun yuan Hsieh, Chin wen Ho, Tsan sheng Hsu, Ming tat Ko, and Gen-Huey Chen An Algorithm for Finding Geometric Automorphisms in Planar Graphs --- Seok-Hee Hong, Peter Eades, and Sang-Ho Lee Facility Location on Terrains --- Boris Aronov, Marc van Kreveld, Ren'e van Oostrum, and Kasturirangan Varadarajan A Quantum Polynomial Time Algorithm in Worst Case for Simon's Problem --- Takashi Mihara and Shao-Chin Sung Optimal Approximate Agreement with Omission Faults --- Richard Plunkett and Alan Fekete $k$-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph --- Toshimasa Ishii, Hiroshi Nagamochi, and Toshihide Ibaraki The Steiner tree problem in $\lambda_4$-geometry plane --- Guo-Hui Lin and Guoliang Xue Generalized Graph Colorability and Compressibility of Boolean Formulae --- Richard Nock, Pascal Jappy, and Jean Sallantin A Capacitated Vehicle Routing Problem on a Tree --- Shin ya Hamaguchi and Naoki Katoh Visibility Queries in Simple Polygons and Applications --- Boris Aronov, Leonidas J. Guibas, Marek Teichmann, and Li Zhang Hamiltonian decomposition of recursive circulants --- Jung-Heum Park On the Complexity of Free Monoid Morphisms --- Klaus-Joern Lange and Pierre McKenzie Testing the quality of manufactured disks and cylinders --- Prosenjit Bose and Pat Morin Random Regular Graphs with Edge Faults Expansion through Cores --- Andreas Goerdt Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles --- Joonsoo Choi, Chan-Su Shin, and Sung Kwon Kim Maximizing Agreement with a Classification by Bounded or Unbounded Number of Words --- Hiroki Arimura and Shinichi Shimozono ------------- 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 From janardan at cs.umn.edu Wed Aug 5 16:32:08 1998 From: janardan at cs.umn.edu (Ravi Janardan) Date: Mon Jan 9 13:40:54 2006 Subject: SCG '98: Pictures etc. Message-ID: <199808052032.UAA08864@cosmos.cs.umn.edu> A set of pictures taken at the 1998 ACM Symp. on Computational Geometry, in Minneapolis, can now be accessed by following links from the Symposium web page (http://www.cs.umn.edu/scg98). Also available there are previously-distributed items such as minutes of the Business meeting and problems presented in the Open Problems session. Ravi Janardan ------------- 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 From rt at cs.brown.edu Thu Aug 6 17:31:51 1998 From: rt at cs.brown.edu (Roberto Tamassia) Date: Mon Jan 9 13:40:54 2006 Subject: Call for Papers: 3rd CGC Workshop on Computational Geometry Message-ID: <35CA12B7.641562E9@cs.brown.edu> -------------- next part -------------- 3rd CGC Workshop on Computational Geometry October 11-12, 1998 Brown University, Providence, RI Sponsored by The Center for Geometric Computing and The Department of Computer Science, Brown University We are pleased to announce the third annual fall Workshop on Computational Geometry, sponsored by the Center for Geometric Computing, continuing a tradition established by the Mathematical Sciences Institute at SUNY-Stony Brook. The Center for Geometric Computing is a collaborative center of Brown, Duke, and Johns Hopkins Universities, and is funded by the U.S. Army Research Office. Scope and Format ---------------- The aim of this workshop is to bring together researchers from academia, industry, and the Army to stimulate collaboration on problems of common interest arising in geometric computations. Topics to be covered include, but are not limited to * Algorithmic methods in geometry * Experimental studies * I/O-scalable geometric algorithms * Geometric data structures * Animation of geometric algorithms * Implementation issues * Computer graphics * Robustness * Solid modeling * Computer vision * Geographic information systems * Robotics * Computational metrology * Computer-aided design * Graph drawing * Mesh generation Following the tradition of the previous MSI and CGC Workshops on Computational Geometry, the format of the workshop will be informal, extending over 2 days, with several breaks scheduled for discussions. Registration will be on-site, and will include the abstract booklet, coffee breaks, lunches, and a reception. There will be a nominal registration fee of $35. Invited speakers ---------------- * Jadgish Chandra (U.S. Army Research Laboratory) * John Hughes (Brown University) * Joe Marks (Mitsubishi Electrical Research Laboratories) * Chee Yap (New York University) Submissions ----------- Authors are invited to submit abstracts for talks to be given at the workshop. Please send an abstract (up to 2 pages) and a draft of a paper (if you have one). E-mail submissions are encouraged; send to cgc@cs.brown.edu. Ideally, the abstract should be a PDF, PostScript, or LaTeX, file, for ease in assembling the abstract booklet. Abstracts can also be sent by regular mail to Roberto Tamassia Department of Computer Science Brown University 115 Waterman Street Providence, RI 02912-1910 Submissions should arrive by September 10, 1998. Authors will be notified of acceptance by September 18, 1997. A booklet of abstracts will be distributed at the workshop and made available electronically on the Web. There will be no formal proceedings for this workshop, but selected papers will be invited to a special issue of the journal "Computational Geometry: Theory and Applications" (edited by Michael T. Goodrich). Program Committee ----------------- * Pankaj K. Agarwal * Joseph S. B. Mitchell * Lars Arge * Franco P. Preparata * Michael T. Goodrich * Roberto Tamassia * S. Rao Kosaraju * Jeffrey S. Vitter Local Arrangements ------------------ * Mary Andrade (maa@cs.brown.edu) * Stina Bridgeman (ssb@cs.brown.edu) * Vasiliki Chatzi (vc@cs.brown.edu) For more information about the workshop, send mail to cgc@cs.brown.edu. Further information will be posted to our web site (http://www.cs.brown.edu/cgc/cgc98/) as soon as it is available. From flatland at ares.cs.siena.edu Thu Aug 6 12:50:14 1998 From: flatland at ares.cs.siena.edu (Robin Flatland) Date: Mon Jan 9 13:40:54 2006 Subject: reconstructing closed curves from curve fragments Message-ID: <9808061550.AA23516@ares.cs.siena.edu> Hi all, I was wondering if anyone knew of work related to the following problem: The input is a set of piece-wise linear curves in the plane. These curves are fragments from the boundaries of some unknown regions. The output needed is a collection of closed, piece-wise linear curves of which the input curves are a subset. These closed curves should somehow capture the shape of the region boundaries. I'm aware of work on reconstructing curves from point data (such as the crust), but hadn't seen anything that considered starting from curve fragments. Thanks, Robin Flatland ********************************************************* Dr. Robin Flatland Computer Science Dept Consultant to GE-CR&D Siena College Image Understanding Group 515 Loudon Road 1400 Balltown Road Loudonville, NY 12211 Schenectady, NY 12301 (518) 782-6541 (518) 393-7379 ******************************************************** ------------- 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 From will at inf.ethz.ch Fri Aug 7 23:43:54 1998 From: will at inf.ethz.ch (Martin Will) Date: Mon Jan 9 13:40:54 2006 Subject: Additively weighted Voronoi diagrams Message-ID: <9808072243.ZM785@yaya> Dear all, I am currently preparing a comparison of algorithms for computing 3-D additively weighted Voronoi (aka Johnson-Mehl) diagrams. However, I could not find an actual implementation of F. Aurenhammer's reduction to 4-D power diagrams, as described e.g. in the textbook by Boissonnat & Yvinec. On request, F. Aurenhammer told me that he could remind some Japanese group working on an implementation. Unfortunately, he wasn't able to recall any more details. I would be very grateful to any hint or reference to either this group or any other person who has worked on this subject. Thank you very much. Hans-Martin Will --------------------------------------------------------------------------- Hans-Martin Will email: will@inf.ethz.ch ETH Zuerich phone: +41-1-632 7335 Institut fuer Theoretische Informatik fax: +41-1-632 1172 CH-8092 Zuerich Switzerland ------------- 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