• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Geometric computing and uniform grid technique

      Thumbnail
      View / Download
      1.0 Mb
      Author
      Akman, W.
      Franklin, W. R.
      Kankanhalli, M.
      Narayanaswami, C.
      Date
      1989
      Source Title
      Computer-Aided Design
      Print ISSN
      0010-4485
      Publisher
      Elsevier
      Volume
      21
      Issue
      7
      Pages
      410 - 420
      Language
      English
      Type
      Article
      Item Usage Stats
      112
      views
      148
      downloads
      Abstract
      If computational geometry should play an important role in the professional environment (e.g. graphics and robotics), the data structures it advocates should be readily implemented and the algorithms efficient. In the paper, the uniform grid and a diverse set of geometric algorithms that are all based on it, are reviewed. The technique, invented by the second author, is a flat, and thus non-hierarchical, grid whose resolution adapts to the data. It is especially suitable for telling efficiently which pairs of a large number of short edges intersect. Several of the algorithms presented here exist as working programs (among which is a visible surface program for polyhedra) and can handle large data sets (i.e. many thousands of geometric objects). Furthermore, the uniform grid is appropriate for parallel processing; the parallel implementation presented gives very good speed-up results. © 1989.
      Keywords
      Boolean operations on polyhedra
      Haloed lines
      Line segment intersection
      Map overlay
      Parallel computational geometry
      Point location
      Polyhedral visibility
      Uniform grid
      Mathematical Techniques
      Line segment intersection
      Parallel computational geometry
      Uniform grid technique
      Computer aided design
      Permalink
      http://hdl.handle.net/11693/26241
      Published Version (Please cite this version)
      http://dx.doi.org/10.1016/0010-4485(89)90125-5
      Collections
      • Department of Computer Engineering 1368
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      Copyright © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy