Nothing Special   »   [go: up one dir, main page]

Wybrow et al., 2012 - Google Patents

Orthogonal hyperedge routing

Wybrow et al., 2012

View PDF
Document ID
7446781226423828702
Author
Wybrow M
Marriott K
Stuckey P
Publication year
Publication venue
Diagrammatic Representation and Inference: 7th International Conference, Diagrams 2012, Canterbury, UK, July 2-6, 2012. Proceedings 7

External Links

Snippet

Orthogonal connectors are used in drawings of many network diagrams, especially those representing electrical circuits. Such diagrams frequently include hyperedges—single edges that connect more than two endpoints. While many interactive diagram editors provide some …
Continue reading at ialab.it.monash.edu (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/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
    • 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
    • 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/5045—Circuit design
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
    • G06F15/163—Interprocessor communication
    • G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
    • 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/20—Drawing from basic elements, e.g. lines or circles
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2217/00—Indexing scheme relating to computer aided design [CAD]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • 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
Kieffer et al. Hola: Human-like orthogonal network layout
Pupyrev et al. Edge routing with ordered bundles
US20190026401A1 (en) Generative space planning in architectural design for efficient design space exploration
US9390216B2 (en) System and method for obstacle-avoiding signal bus routing
CN103984789B (en) Obstacle bypassing wiring method based on optimization of shortest wire length in large-sized integrated circuit design
Volpato et al. Combining heuristics for tool-path optimisation in material extrusion additive manufacturing
Nachmanson et al. Graphmaps: Browsing large graphs as interactive maps
CN108958611B (en) Information editing method and device
Huang et al. On the construction of optimal obstacle-avoiding rectilinear Steiner minimum trees
US11205024B2 (en) Techniques for measuring productive congestion within an architectural space
Wybrow et al. Orthogonal hyperedge routing
US20140164664A1 (en) Orthogonal layout generation
JP5987720B2 (en) Binary decision graph processing system and method
Jünger et al. Intersection graphs in simultaneous embedding with fixed edges
Gange et al. Optimal k-level planarization and crossing minimization
Dechu et al. An efficient routing tree construction algorithm with buffer insertion, wire sizing, and obstacle considerations
Asquith et al. An ILP for the metro-line crossing problem.
US20230075061A1 (en) Sweepline triangulation for spanning graphs
US10424096B1 (en) Technique for orthogonal edge routing of directed layered graphs with edge crossings reduction
He A simple linear time algorithm for proper box rectangular drawings of plane graphs
van Dijk et al. Location‐dependent generalization of road networks based on equivalent destinations
Oliveira et al. Network-on-chip irregular topology optimization for real-time and non-real-time applications
Peyer et al. Delay-related secondary objectives for rectilinear Steiner minimum trees
Balkanski et al. The simultaneous semi-random model for TSP
CN114095807A (en) Automatic routing method and device for optical cable route and electronic equipment