Line Drawings that Appear Unsharp

2011 ◽  
Vol 2 (1) ◽  
pp. 1-13
Author(s):  
Hans Dehlinger
Keyword(s):  
Point Of View ◽  
Geometric Transformations ◽  
Line Drawings ◽  
Straight Line

A straight line, pen-drawn and executed on a pen-plotter, is by default sharp and crisp. This is the nature of a straight line between two points. Likewise, drawings generated from such lines are by definition sharp. This paper considers generative line drawings, executed on a pen-plotter which appears to be wholly or in part unsharp when viewed. Described here are some strategies based on systematic experiments with geometric transformations to produce such drawings. The topic is approached from an artist’s point of view with a focus on the generative and algorithmic issues involved, and the results are demonstrated by examples.

Line Drawings that Appear Unsharp

2012 ◽  
pp. 149-162
Author(s):  
Hans Dehlinger
Keyword(s):  
Point Of View ◽  
Geometric Transformations ◽  
Line Drawings ◽  
Straight Line

A straight line, pen-drawn and executed on a pen-plotter, is by default sharp and crisp. This is the nature of a straight line between two points. Likewise, drawings generated from such lines are by definition sharp. This paper considers generative line drawings, executed on a pen-plotter which appears to be wholly or in part unsharp when viewed. Described here are some strategies based on systematic experiments with geometric transformations to produce such drawings. The topic is approached from an artist’s point of view with a focus on the generative and algorithmic issues involved, and the results are demonstrated by examples.

Acute Constraints in Straight-Line Drawings of Planar Graphs

2019 ◽  
Vol E102.A (9) ◽  
pp. 994-1001
Author(s):  
Akane SETO ◽  
Aleksandar SHURBEVSKI ◽  
Hiroshi NAGAMOCHI ◽  
Peter EADES
Keyword(s):  
Planar Graphs ◽  
Line Drawings ◽  
Straight Line

Contribution to the knowledge of pupae of the Western Palaearctic erebids (Lepidoptera: Erebidae: Herminiinae) and noctuids (Lepidoptera: Noctuidae: Acronictinae and Bryophilinae)

Biologia ◽  
2009 ◽  
Vol 64 (1) ◽  
Author(s):  
Jan Patočka ◽  
Marek Turčáni
Keyword(s):  
Morphological Features ◽  
Point Of View ◽  
Palaearctic Species ◽  
Line Drawings ◽  
Systematic Status ◽  
Western Palaearctic ◽  
Lepidoptera Noctuidae ◽  
Current Systems

AbstractThe descriptions of pupae of three Western Palaearctic species of Erebidae (subfamily Herminiinae), namely Idia calvaria (Denis et Schiffermüller, 1775), Pechipogo flavicrinalis (Andreas, 1910), and Nodaria nodosalis (Herrich-Schäffer, 1851), and three species of Noctuidae (subfamilies Acronictinae and Bryophilinae), namely Oxicesta geographica (F., 1787), Simyra dentinosa (Freyer, 1839), and Cryphia ochsi Boursin, 1940 are given. The main morphological features are described, compared with those of the related taxa and also illustrated in 57 line drawings. The systematic status and position of the described species present in the current systems are also discussed from the point of view of morphology of their pupae.

scholarly journals Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions

2017 ◽  
Vol 27 (01n02) ◽  
pp. 121-158 ◽  
Author(s):  
Martin Nöllenburg ◽  
Roman Prutkin ◽  
Ignaz Rutter
Keyword(s):  
Routing Protocol ◽  
Graph Drawing ◽  
Geographic Routing ◽  
Np Hard ◽  
Line Drawings ◽  
Simple Polygons ◽  
Straight Line ◽  
Starting Point ◽  
Minimum Decomposition ◽  
Geographic Routing Protocol

A greedily routable region (GRR) is a closed subset of [Formula: see text], in which any destination point can be reached from any starting point by always moving in the direction with maximum reduction of the distance to the destination in each point of the path. Recently, Tan and Kermarrec proposed a geographic routing protocol for dense wireless sensor networks based on decomposing the network area into a small number of interior-disjoint GRRs. They showed that minimum decomposition is NP-hard for polygonal regions with holes. We consider minimum GRR decomposition for plane straight-line drawings of graphs. Here, GRRs coincide with self-approaching drawings of trees, a drawing style which has become a popular research topic in graph drawing. We show that minimum decomposition is still NP-hard for graphs with cycles and even for trees, but can be solved optimally for trees in polynomial time, if we allow only certain types of GRR contacts. Additionally, we give a 2-approximation for simple polygons, if a given triangulation has to be respected.

PENERAPAN PSAP NOMOR 07 TENTANG AKUNTANSI ASET TETAP PADA KANTOR KEPOLISIAN RESOR KOTA LUBUKLINGGAU

2021 ◽  
Vol 4 (3) ◽  
pp. 961
Author(s):  
Norman Hadi ◽  
Sriyani Sriyani
Keyword(s):  
Financial Reporting ◽  
Financial Management ◽  
Balance Sheet ◽  
Economic Benefits ◽  
Point Of View ◽  
Police Station ◽  
Straight Line ◽  
Fixed Assets ◽  
The Government

The reform of state financial management in 2003 was aimed at realizing transparent and accountable government financial reporting. Reform of state financial management is the first step in improving the quality of state finances. In the government environment, fixed assets play an important role in government operations and also benefit the community. The problem studied is how the suitability of accounting for fixed assets at the Lubuklinggau Police with PSAP number 07 concerning Accounting for Fixed Assets from the point of view of recognition, measurement, presentation, and disclosure of Fixed Assets in Financial Statements. The research method used is a qualitative method, the method of data collection is carried out by means of observation and interviews with parties related to accounting at the Lubuklinggau Police Station. The results of this study are the Lubuklinggau Police Station has implemented Fixed Asset Accounting in accordance with PSAP 07, namely Assets are recognized when future economic benefits have been obtained and their value can be measured reliably, Fixed Assets are measured at cost, depreciation is carried out using a straight line and presented in Balance sheet according to PSAP 07.

scholarly journals Distinct Distances in Graph Drawings

10.37236/831 ◽  
2008 ◽  
Vol 15 (1) ◽  
Author(s):  
Paz Carmi ◽  
Vida Dujmović ◽  
Pat Morin ◽  
David R. Wood
Keyword(s):  
Maximum Degree ◽  
Combinatorial Geometry ◽  
Complete Graphs ◽  
Bounded Degree ◽  
Cartesian Products ◽  
Bounded Treewidth ◽  
Line Drawings ◽  
Straight Line ◽  
Minimum Number ◽  
Complete Bipartite Graphs

The distance-number of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the distance-number of trees, graphs with no $K^-_4$-minor, complete bipartite graphs, complete graphs, and cartesian products. Our main results concern the distance-number of graphs with bounded degree. We prove that $n$-vertex graphs with bounded maximum degree and bounded treewidth have distance-number in ${\cal O}(\log n)$. To conclude such a logarithmic upper bound, both the degree and the treewidth need to be bounded. In particular, we construct graphs with treewidth $2$ and polynomial distance-number. Similarly, we prove that there exist graphs with maximum degree $5$ and arbitrarily large distance-number. Moreover, as $\Delta$ increases the existential lower bound on the distance-number of $\Delta$-regular graphs tends to $\Omega(n^{0.864138})$.

Sign in / Sign up

Export Citation Format

Share Document