Information hiding through variance of the parametric orientation underlying a B-rep face

Watermarking technologies have been proposed for many different,types of digital media. However, to this date, no viable watermarking techniques have yet emerged for the high value B-rep (i.e. Boundary Representation) models used in 3D mechanical CAD systems. In this paper, the authors propose a new approach (PO-Watermarking) that subtly changes a model's geometric representation to incorporate a 'transparent' signature. This scheme enables software applications to create fragile, or robust watermarks without changing the size of the file, or shape of the CAD model. Also discussed is the amount of information the proposed method could transparently embed into a B-rep model. The results presented demonstrate the embedding and retrieval of text strings and investigate the robustness of the approach after a variety of transformation and modifications have been carried out on the data

Relating cell shape and mechanical stress in a spatially disordered epithelium using a vertex-based model

Using a popular vertex-based model to describe a spatially disordered planar epithelial monolayer, we examine the relationship between cell shape and mechanical stress at the cell and tissue level. Deriving expressions for stress tensors starting from an energetic formulation of the model, we show that the principal axes of stress for an individual cell align with the principal axes of shape, and we determine the bulk effective tissue pressure when the monolayer is isotropic at the tissue level. Using simulations for a monolayer that is not under peripheral stress, we fit parameters of the model to experimental data for Xenopus embryonic tissue. The model predicts that mechanical interactions can generate mesoscopic patterns within the monolayer that exhibit long-range correlations in cell shape. The model also suggests that the orientation of mechanical and geometric cues for processes such as cell division are likely to be strongly correlated in real epithelia. Some limitations of the model in capturing geometric features of Xenopus epithelial cells are highlighted.Comment: 29 pages, 10 figures, revisio

Approaching Visual Search in Photo-Realistic Scenes

Visual search is extended from the domain of polygonal figures presented on a uniform background to scenes in which search is for a photo-realistic object in a dense, naturalistic background. Scene generation for these displays relies on a powerful solid modeling program to define the three dimensional forms, surface properties, relative positions, and illumination of the objects and a rendering program to produce an image. Search in the presented experiments is for a rock with specific properties among other, similar rocks, although the method described can be generalized to other situations. Using this technique we explore the effects of illumination and shadows in aiding search for a rock in front of and closer to the viewer than other rocks in the scene. For these scenes, shadows of two different contrast levels can significantly deet·ease reaction times for displays in which target rocks are similar to distractor rocks. However, when the target rock is itself easily distinguishable from dis tractors on the basis of form, the presence or absence of shadows has no discernible effect. To relate our findings to those for earlier polygonal displays, we simplified the non-shadow displays so that only boundary information remained. For these simpler displays, search slopes (the reaction time as a function of the number of distractors) were significantly faster, indicating that the more complex photo-realistic objects require more time to process for visual search. In contrast with several previous experiments involving polygonal figures, we found no evidence for an effect of illumination direction on search times

Triangles bridge the scales: Quantifying cellular contributions to tissue deformation

In this article, we propose a general framework to study the dynamics and topology of cellular networks that capture the geometry of cell packings in two-dimensional tissues. Such epithelia undergo large-scale deformation during morphogenesis of a multicellular organism. Large-scale deformations emerge from many individual cellular events such as cell shape changes, cell rearrangements, cell divisions, and cell extrusions. Using a triangle-based representation of cellular network geometry, we obtain an exact decomposition of large-scale material deformation. Interestingly, our approach reveals contributions of correlations between cellular rotations and elongation as well as cellular growth and elongation to tissue deformation. Using this Triangle Method, we discuss tissue remodeling in the developing pupal wing of the fly Drosophila melanogaster.Comment: 26 pages, 18 figure

Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions

A greedily routable region (GRR) is a closed subset of $\mathbb R^2$, in which each destination point can be reached from each starting point by choosing 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 polygons 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, but can be solved optimally for trees in polynomial time. Additionally, we give a 2-approximation for simple polygons, if a given triangulation has to be respected.Comment: full version of a paper appearing in ISAAC 201