In this paper we investigate the general position model for the drawing of arbitrary degree graphs in the D-dimensional (D ≥ 2) orthogonal grid. In this model no two vertices lie in the same grid hyperplane. We show that for D ≥ 3, given an arbitrary layout and initial edge routing a crossing-free orthogonal drawing can be determined. We distinguish two types of algorithms. Our layout-based alg...

A numerical gradient flow procedure was devised to characterize minimal energy shapes of fusion pores connecting two parallel planar bilayer membranes. Pore energy, composed of splay, tilt, and stretching, was obtained by modeling each bilayer as two monolayers and treating each monolayer of a bilayer membrane as a freely deformable surface described with a mean lipid orientation field. Voids b...

Pluta polarizing interference microscope was used to follow the crazing that occur on the surface of stretched polypropylene fibres at different drawing conditions. The samples were stretched until crazing initiated, and then craze propagation was monitored as a function of drawing speed and test temperature. The effect of craze dimension on their propagation velocity was taken into account. Th...

We study a problem motivated by rectilinear schematization of geographic maps. Given a biconnected plane graph G and an integer k ≥ 0, does G have a strictorthogonal drawing (i.e., an orthogonal drawing without edge bends) with at most k reflex angles per face? For k = 0, the problem is equivalent to realizing each face as a rectangle. We prove that the strict-orthogonal drawability problem for...

IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs. Given an embedded IC-planar graph G with n vertices, we present an O(n)-time algorithm that computes a straight-line drawing of G in quadratic area, and an O(n3)-time algorithm that computes a straight-li...

Given a biconnected plane graph G and a nonnegative integer k, we examine the problem of deciding whether G admits a strict-orthogonal drawing (i.e., an orthogonal drawing without bends) such that the reflex face complexity (the maximum number of reflex angles in any face) is at most k. We introduce a new technique to solve the problem in O(n min{k, log n log k}) time, while no such subquadrati...

Just how much can a pheromone-enabled swarm do? Motivated by robotic construction, we set out to show that a swarm of computationally simple ants, communicating only via pheromones, can in fact perform classic compass-straightedge geometry, and thus can make many shapes and perform many nontrivial geometric tasks. The ants do not need speciallydesigned stigmergic building materials, a prepared ...

We examine the influence of domain-specific knowledge on the process of learning and representing simple visual categories. Depending on whether subjects’ construe simple objects as living kinds or machines, they show differential sensitivity to the importance of basic shape features. In particular, subjects who treated the objects as machines placed less importance on coarse shape differences ...

This paper presents a strategy of adaptive online sketchy shape recognition. The inputting sketchy shapes are recognized online by means of a modified Support Vector Machine (SVM) incremental learning classifier. All classified results evaluated by user are collected and some important samples are selected according to their distances to the hyper-plane of the SVM-classifier. The classifier can...

Most of open-source software systems become available on the internet today. Thus, we need automatic methods to label software code. Software code can be labeled with a set of keywords. These keywords in this paper referred as software labels. The goal of this paper is to provide a quick view of the software code vocabulary. This paper proposes an automatic approach to document the object-orien...