[-] Show simple item record

dc.contributor.authorHaithcoat, Timeng
dc.date.issued1999eng
dc.description.abstractThis presentation deals with data structures and algorithms not inherent to ARC. It is mostly concerned with line coverages (AATs). Topics include: node-arc lists (NAL), NODE Valence tables (VAL), dangling and orphan ARCs, travel time to a node (ALLOCATE), polygon neighbor list, and backwalking a least-cost path.eng
dc.identifier.citationMissouri Spatial Data Information Serviceeng
dc.identifier.urihttp://hdl.handle.net/10355/3226eng
dc.languageEnglisheng
dc.publisherMissouri Spatial Data Information Serviceeng
dc.relation.ispartofMissouri Spatial Data Information Service presentationseng
dc.relation.ispartofcommunityUniversity of Missouri-Columbia. College of Arts and Sciences. Department of Geography. Missouri Spatial Data Information Serviceeng
dc.rightsOpenAccess.eng
dc.rights.licenseThis work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 License.eng
dc.source.urihttp://www.msdis.missouri.edu/presentations/index.htmeng
dc.subjectGISeng
dc.subjectINFOeng
dc.subjectnodeeng
dc.subject.lcshARC/INFOeng
dc.titleNavigating INFO: Advanced Processingeng
dc.typePresentationeng


Files in this item

[PDF]

This item appears in the following Collection(s)

[-] Show simple item record