[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Nickerson, 1988 - Google Patents

Automated cartographic generalization for linear features

Nickerson, 1988

View PDF
Document ID
1944792384045529265
Author
Nickerson B
Publication year
Publication venue
Cartographica: The International Journal for Geographic Information and Geovisualization

External Links

Snippet

An automated method is presented for the generalization of linear features that are already in a topologically structured computer-readable form. The method consists of three stages: feature elimination; feature simplification; and interference detection and resolution. The first …
Continue reading at www.utpjournals.press (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G06F17/30958—Graphs; Linked lists
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in preceding groups
    • G01C21/26—Navigation; Navigational instruments not provided for in preceding groups specially adapted for navigation in a road network
    • G01C21/28—Navigation; Navigational instruments not provided for in preceding groups specially adapted for navigation in a road network with correlation of data from several navigational instruments
    • G01C21/30—Map- or contour-matching
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects

Similar Documents

Publication Publication Date Title
Nickerson Automated cartographic generalization for linear features
De Floriani et al. Hierarchical triangulation for multiresolution surface description
Edelsbrunner et al. Topologically sweeping an arrangement
Sleator et al. A data structure for dynamic trees
Renka Algorithm 751: TRIPACK: a constrained two-dimensional Delaunay triangulation package
Samet The quadtree and related hierarchical data structures
Chiba et al. A linear algorithm for embedding planar graphs using PQ-trees
Bentley et al. Algorithms for reporting and counting geometric intersections
Cline et al. A storage-efficient method for construction of a Thiessen triangulation
Floriani et al. Visibility algorithms on triangulated digital terrain models
Samet Region representation: Quadtrees from boundary codes
Mata et al. A new algorithm for computing shortest paths in weighted planar subdivisions
Dyer et al. Parallel image processing by memory-augmented cellular automata
Edelsbrunner et al. Implicitly representing arrangements of lines or segments
Chazelle How to search in history
Cabello et al. Testing homotopy for paths in the plane
Ubeda et al. Topological error correcting in GIS
Palazzi et al. Counting and reporting red/blue segment intersections
Wang et al. Complex coastline generalization
DRYSDALE III Generalized voronoi diagrams and geometric searching.
Peuquet A hybrid structure for the storage and manipulation of very large spatial data sets
Agarwal et al. Intersection queries for curved objects
Fujimura et al. A hierarchical space indexing method
Greenlees Commutative algebra in group cohomology
Cunningham et al. Combinatorial optimization