Giovannangeli et al., 2022 - Google Patents

FORBID: Fast overlap removal by stochastic gradient descent for graph drawing

Giovannangeli et al., 2022

View PDF
Document ID
5056131877298218100
Author
Giovannangeli L
Lalanne F
Giot R
Bourqui R
Publication year
Publication venue
International Symposium on Graph Drawing and Network Visualization

External Links

Snippet

While many graph drawing algorithms consider nodes as points, graph visualization tools often represent them as shapes. These shapes support the display of information such as labels or encode various data with size or color. However, they can create overlaps between …
Continue reading at arxiv.org (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/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • 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
    • 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
    • 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
    • G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
    • G06Q10/063—Operations research or analysis
    • G06Q10/0639—Performance analysis
    • G06Q10/06393—Score-carding, benchmarking or key performance indicator [KPI] analysis
    • 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
    • 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
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T3/00—Geometric image transformation in the plane of the image, e.g. from bit-mapped to bit-mapped creating a different image
    • G06T3/40—Scaling the whole image or part thereof
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass

Similar Documents

Publication Publication Date Title
US7932907B2 (en) Layered graph layouts with a given aspect ratio
Bommes et al. Integer-grid maps for reliable quad meshing
Bekos et al. External labeling techniques: A taxonomy and survey
Häuser et al. Convex multiclass segmentation with shearlet regularization
Lukasczyk et al. Localized topological simplification of scalar data
Anotaipaiboon et al. Tool path generation for five-axis NC machining using adaptive space-filling curves
Mustafa et al. Dynamic simplification and visualization of large maps
Giovannangeli et al. FORBID: Fast overlap removal by stochastic gradient descent for graph drawing
US20130120456A1 (en) Method and apparatus for searching, replacing and modifying explicit and implicit shape in sketch-style drawings of various styles
US20200098086A1 (en) Generating enhanced digital content using piecewise parametric patch deformations
Niedermann et al. An algorithmic framework for labeling network maps
Kahra et al. Fast morphological dilation and erosion for grey scale images using the Fourier transform
Halperin et al. Space-aware reconfiguration
Angelini et al. Extending partial orthogonal drawings
Nickel et al. Computing stable demers cartograms
Behroozi Largest inscribed rectangles in geometric convex sets
Gehre et al. Adapting feature curve networks to a prescribed scale
Hong et al. Re-embedding a 1-plane graph into a straight-line drawing in linear time
Basu et al. The triangle closure is a polyhedron
Zawallich Unfolding polyhedra via tabu search
Alegría et al. Unit-length rectangular drawings of graphs
Tollenaere et al. Efficient use of collision detection for volume maximization problems
Agranovsky et al. A multi-resolution interpolation scheme for pathline based Lagrangian flow representations
Kasperowski et al. Top-down drawings of compound graphs
Giovannangeli et al. FORBID: Fast Overlap Removal by Stochastic GradIent Descent