Hültenschmidt et al., 2016 - Google Patents
Drawing trees and triangulations with few geometric primitivesHültenschmidt et al., 2016
View PDF- Document ID
- 16604187231137687
- Author
- Hültenschmidt G
- Kindermann P
- Meulemans W
- Schulz A
- Publication year
- Publication venue
- 32nd European Workshop on Computational Geometry (EuroCG 2016)
External Links
Snippet
We define the visual complexity of a plane graph drawing to be the number of geometric objects needed to represent all its edges. In particular, one object may represent multiple edges (eg you need only one line segment to draw two collinear edges of the same vertex) …
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/20—Handling natural language data
- G06F17/21—Text processing
- G06F17/24—Editing, e.g. insert/delete
-
- 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
- G06F17/21—Text processing
- G06F17/22—Manipulating or registering by use of codes, e.g. in sequence of text characters
-
- 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
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Chen et al. | A Voronoi-based 9-intersection model for spatial relations | |
| Cano et al. | Mosaic drawings and cartograms | |
| CN105678626B (en) | Overlapping community mining method and device | |
| CN105513008B (en) | A kind of image processing method and device | |
| Chan | A near-linear area bound for drawing binary trees | |
| Parakkat et al. | Crawl through neighbors: A simple curve reconstruction algorithm | |
| Xu et al. | Common developments of three incongruent boxes of area 30 | |
| CN109727252B (en) | Method for dividing polygon by arbitrary dividing line | |
| Kenyon et al. | Dimers, tilings and trees | |
| Dechter | Tractable structures for constraint satisfaction problems | |
| De Berg et al. | Optimal BSPs and rectilinear cartograms | |
| Hültenschmidt et al. | Drawing trees and triangulations with few geometric primitives | |
| Surazhsky et al. | Blending polygonal shapes with different topologies | |
| Abrahamsen et al. | Fast fencing | |
| CN109242750A (en) | Picture signature method, picture match method, apparatus, equipment and storage medium | |
| Watson et al. | The vertex splitting algorithm for facilities layout | |
| Aronov et al. | Witness rectangle graphs | |
| Wang et al. | Orthogonal voronoi diagram and treemap | |
| US7823094B2 (en) | Pseudo-string based pattern recognition in L3GO designs | |
| Barahona | On the k-cut problem | |
| CN101944078B (en) | Typesetting method and device thereof | |
| Agarwal | An improved algorithm for computing the volume of the union of cubes | |
| Rusu et al. | A straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratio | |
| Pach et al. | A generalization of quasi-planarity | |
| Eades et al. | Orthogonal grid drawing of clustered graphs |