Results 11 to 20 of about 352 (118)
The Straight-Line RAC Drawing Problem is NP-Hard
Journal of Graph Algorithms and Applications, 2012 A RAC drawing of a graph is a polyline drawing in which every pair of crossing edges intersects at right angle. In this paper, we focus on straight-line RAC drawings and demonstrate an infinite class of graphs with unique RAC combinatorial embedding.
Evmorfia Argyriou +2 more
doaj +1 more source
The Maximum Number of Edges in a Three-Dimensional Grid-Drawing
Journal of Graph Algorithms and Applications, 2004 An exact formula is given for the maximum number of edges in a graph that admits a three-dimensional grid-drawing contained in a given bounding box.
Prosenjit Bose +3 more
doaj +1 more source
Aligned Drawings of Planar Graphs
Journal of Graph Algorithms and Applications, 2018 Let $G$ be a graph that is topologically embedded in the plane and let $\mathcal A$ be an arrangement of pseudolines intersecting the drawing of $G$.
Tamara Mchedlidze +2 more
doaj +1 more source
Известия высших учебных заведений России: Радиоэлектроника, 2020 Introduction. Modern antenna devices contain a large number of repeating elements. The process of development of CAD models of such devices requires repeatedly performed operations that is a routine task for an engineer.
V. G. Koshkid’ko, M. M. Migalin
doaj +1 more source
On the Perspectives Opened by Right Angle Crossing Drawings
Journal of Graph Algorithms and Applications, 2011 Right Angle Crossing (RAC) drawings are polyline drawings where each crossing forms four right angles. RAC drawings have been introduced because cognitive experiments provided evidence that increasing the number of crossings does not decrease the ...
Patrizio Angelini +6 more
doaj +1 more source
On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles [PDF]
, 2011 We consider graphs that admit polyline drawings where all crossings occur at the same angle α ∈ (0, π/2). We prove that every graph on n vertices that admits such a polyline drawing with at most two bends per edge has O(n) edges. This result remains true when each crossing occurs at an angle from a small set of angles.
Eyal Ackerman +2 more
openaire +1 more source
Using Fuzzy Hybrid Features to Classify Strokes in Interactive Sketches
Advances in Mechanical Engineering, 2013 A novel method is presented based on fuzzy hybrid-based features to classify strokes into 2D line drawings, and a human computer interactive system is developed for assisting designers in conceptual design stage. Fuzzy classifiers are built based on some
Shuxia Wang +3 more
doaj +1 more source
Advanced Intelligent Systems, EarlyView.This study introduces Cellular Material Network (CM‐Net), a pioneering machine learning architecture integrating physical information, to predict the mechanical properties of cellular materials. Comprehensive validation through simulations and experiments demonstrates its accuracy in predicting nonlinear behaviors, including initial peak compression ...
Sicong Zhou +5 more
wiley +1 more source
Complex Versus Parsimonious Site‐Based Stochastic Ground Motion Models: Which One Is Better?
Earthquake Engineering &Structural Dynamics, EarlyView.ABSTRACT Stochastic ground motion models (GMMs) provide a probabilistic representation of seismic input and are increasingly important for uncertainty quantification (UQ) in earthquake engineering. This study focuses on site‐based stochastic GMMs, which learn the statistical features of selected datasets of seismic records and generate statistically ...
Maijia Su +2 more
wiley +1 more source
On RAC Drawings of Graphs with Two Bends per Edge
Journal of Graph Algorithms and ApplicationsIt is shown that every $n$-vertex graph that admits a 2-bend RAC drawing in the plane, where the edges are polylines with two bends per edge and any pair of edges can only cross at a right angle, has at most $20n-24$ edges for $n\geq 3$.
Csaba Tóth
doaj +1 more source