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

Barton et al., 1980 - Google Patents

The polygon package

Barton et al., 1980

Document ID
4649986569155643413
Author
Barton E
Buchanan I
Publication year
Publication venue
computer-aided design

External Links

Snippet

The polygon package is a set of procedures which manipulate geometric objects in the 2D plane. The operations that can be performed on these objects, regarded as polygons, include intersection, union, asymmetric difference, inflation and deflation. Polygons may …
Continue reading at www.sciencedirect.com (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/50—Computer-aided design
    • G06F17/5068—Physical circuit design, e.g. layout for integrated circuits or printed circuit boards
    • G06F17/5081—Layout analysis, e.g. layout verification, design rule check
    • 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/5068—Physical circuit design, e.g. layout for integrated circuits or printed circuit boards
    • G06F17/5077—Routing
    • 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
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T11/00—2D [Two Dimensional] image generation
    • G06T11/20—Drawing from basic elements, e.g. lines or circles
    • G06T11/206—Drawing of charts or graphs
    • 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/5086—Mechanical design, e.g. parametric or variational design
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T11/00—2D [Two Dimensional] image generation
    • G06T11/20—Drawing from basic elements, e.g. lines or circles
    • G06T11/203—Drawing of straight lines or curves
    • 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
    • G06T17/20—Finite element generation, e.g. wire-frame surface description, tesselation
    • 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/20—Handling natural language data
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T11/00—2D [Two Dimensional] image generation
    • G06T11/40—Filling a planar surface by adding surface attributes, e.g. colour or texture
    • 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/10—Complex mathematical operations
    • 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
    • G06T17/05—Geographic models

Similar Documents

Publication Publication Date Title
Näher LEDA, a platform for combinatorial and geometric computing
Barton et al. The polygon package
Frisken et al. Simple and efficient traversal methods for quadtrees and octrees
Alt et al. Discrete geometric shapes: Matching, interpolation, and approximation
Gangnet et al. Incremental computation of planar maps
CN101739494A (en) Computer-implemented method of computing, in a computer aided design system, of a boundary of a modeled object
Eades et al. Drawing clustered graphs on an orthogonal grid
Sharir et al. External polygon containment problems
Arkin et al. Shortest path to a segment and quickest visibility queries
Viertel et al. Coarse quad layouts through robust simplification of cross field separatrix partitions
Miller et al. Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings
Graham et al. A whirlwind tour of computational geometry
Seiler A hardware assisted design rule check architecture
US6373486B1 (en) Method and apparatus for creating representations of geologic shapes
Mount CMSC 754 Computational geometry
Aubry et al. An entropy satisfying boundary layer surface mesh generation
Zhao et al. HSW: Heuristic Shrink-wrapping for automatically repairing solid-based CityGML LOD2 building models
JPH07334541A (en) Element generation system for numerical analysis
Shin et al. Two-center problems for a convex polygon
Freivalds et al. Optimum layout adjustment supporting ordering constraints in graph-like diagram drawing
Kakoulis et al. Algorithms for the multiple label placement problem
Ronfard et al. Triangulating multiply‐connected polygons: A simple, yet efficient algorithm.
O'Rourke et al. Tailoring for every body: Reshaping convex polyhedra
Sandgren et al. Part layout optimization using a quadtree representation
Hershberger et al. A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane