Geometric computing and uniform grid technique

Simple item page
dc.citation.epage420en_US
dc.citation.issueNumber7en_US
dc.citation.spage410en_US
dc.citation.volumeNumber21en_US
dc.contributor.authorAkman, W.en_US
dc.contributor.authorFranklin, W. R.en_US
dc.contributor.authorKankanhalli, M.en_US
dc.contributor.authorNarayanaswami, C.en_US
dc.date.accessioned2016-02-08T10:56:55Z
dc.date.available2016-02-08T10:56:55Z
dc.date.issued1989en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.description.abstractIf 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.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T10:56:55Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 1989en
dc.identifier.doi10.1016/0010-4485(89)90125-5en_US
dc.identifier.issn0010-4485
dc.identifier.urihttp://hdl.handle.net/11693/26241
dc.language.isoEnglishen_US
dc.publisherElsevieren_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/0010-4485(89)90125-5en_US
dc.source.titleComputer-Aided Designen_US
dc.subjectBoolean operations on polyhedraen_US
dc.subjectHaloed linesen_US
dc.subjectLine segment intersectionen_US
dc.subjectMap overlayen_US
dc.subjectParallel computational geometryen_US
dc.subjectPoint locationen_US
dc.subjectPolyhedral visibilityen_US
dc.subjectUniform griden_US
dc.subjectMathematical Techniquesen_US
dc.subjectLine segment intersectionen_US
dc.subjectParallel computational geometryen_US
dc.subjectUniform grid techniqueen_US
dc.subjectComputer aided designen_US
dc.titleGeometric computing and uniform grid techniqueen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Geometric computing and uniform grid technique.pdf
Size:
1.04 MB
Format:
Adobe Portable Document Format
Description:
Full Printable Version
Download

Collections

Department of Computer Engineering