scholarly journals Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem

2010 ◽  
Vol 76 (7) ◽  
pp. 650-662 ◽  
Author(s):  
Nathann Cohen ◽  
Fedor V. Fomin ◽  
Gregory Gutin ◽  
Eun Jung Kim ◽  
Saket Saurabh ◽  
...  
Keyword(s):  
Branching Problem

Surface Reconstruction From Dexel Data for Virtual Sculpting

2004 ◽  
Author(s):  
Xiaobo Peng ◽  
Weihan Zhang ◽  
Sai-Gowthami Asam ◽  
Ming C. Leu
Keyword(s):  
Surface Reconstruction ◽  
Cross Sections ◽  
Geometric Modeling ◽  
Ray Casting ◽  
Virtual Sculpting ◽  
Shortest Distance ◽  
Branching Problem ◽  
Volume Ray Casting ◽  
Swept Volume ◽  
Differential Equation Method

This paper presents a new method for surface reconstruction from dexel data for virtual sculpting. We are in the midst of developing a dexel model based sculpting system having the capability of interactive solid modeling with haptics interface. The geometric modeling of our sculpting system is based on the Sweep Differential Equation method to compute the boundary of the tool swept volume. Ray casting is used to perform Boolean operations between the tool swept volume and the virtual stock in dexel models to simulate the sculpting process. The dexel data are converted to a series of planar contours in parallel slices (i.e. cross sections). The overlapping ratio between two contour areas is used as the criterion for deciding on the corresponding contours in two adjacent slices. The tiling problem is tackled by using the rule of the shortest distance between points on two corresponding contours. The branching problem is solved by adding one line segment between two contours to form one composite contour. Examples are given to demonstrate the ability of the developed code to convert from dexel data to triangular meshes for the viewing of a sculpted model in different directions.

scholarly journals The b-branching problem in digraphs

2020 ◽  
Vol 283 ◽  
pp. 565-576
Author(s):  
Naonori Kakimura ◽  
Naoyuki Kamiyama ◽  
Kenjiro Takazawa
Keyword(s):  
Branching Problem

Theory of Viscoplastic Lubrication: Part 2—Applications

1992 ◽  
Vol 114 (3) ◽  
pp. 477-484 ◽  
Author(s):  
W. R. D. Wilson ◽  
X. B. Huang
Keyword(s):  
Boundary Conditions ◽  
Companion Paper ◽  
Slider Bearing ◽  
Reynolds Equations ◽  
Different Types ◽  
Branching Problem ◽  
Inlet Zone ◽  
Development Methods ◽  
Newtonian Behavior

The Reynolds equations for viscoplastic lubricants can be quite complex, involving multiple branches which depend on the form of the boundary conditions invoked in their development. Methods of visualizing and understanding the branching problem are explored. This information is used, together with the Reynolds equations developed in the companion paper, in analyses of the lubrication of a wide slider bearing and a metalforming inlet zone. The results of these analyses are used to draw general conclusions regarding the influence of different types of non-Newtonian behavior.

scholarly journals Branching Problem of Crack and Debonding at an End of Stiffened Boundary for Thin Plate Bending.

1995 ◽  
pp. 27-38 ◽  
Author(s):  
Masahiro Miwa ◽  
Norio Hasebe ◽  
Masaki Nakashima ◽  
Takuji Nakamura
Keyword(s):  
Thin Plate ◽  
Plate Bending ◽  
Branching Problem ◽  
Thin Plate Bending

scholarly journals A New Modeling Method for Objects with Branching Problem Using Non-uniform B-Spline

2004 ◽  
pp. 1095-1102 ◽  
Author(s):  
Hyo Shin Kim ◽  
Yoon Hyuk Kim ◽  
Yeon Hyeon Choe ◽  
Sung-Min Kim ◽  
Taeg-Sang Cho ◽  
...  
Keyword(s):  
Modeling Method ◽  
B Spline ◽  
Branching Problem

Consciousness and Synchronic Identity

Dialogue ◽  
1990 ◽  
Vol 29 (4) ◽  
pp. 523-530
Author(s):  
Carl Matheson
Keyword(s):  
Personal Identity ◽  
Philosophical Literature ◽  
Unity Of Consciousness ◽  
The Past ◽  
Single Person ◽  
Branching Problem

The question “What makes a group of simultaneous experiences the experiences of a single person?” has been nearly ignored in the philosophical literature for the past few decades. The most common answer (e.g., Parfit 1984) to this much neglected question is “Two simultaneous experiences belong to a single person if there is a common consciousness or awareness of them.” However, consciousness and awareness are difficult concepts to analyze, so that little of substance has been said of the answer. Recently, Oaklander has argued that the awareness answer is deficient for a different reason, claiming that it fails because “it ultimately rests on an analysis of the unity of consciousness that is itself circular or otherwise inadequate” Oaklander 1987, p. 525). Oaklander's criticism is especially interesting because, according to it, the awareness account of synchronic personal identity falls prey to the main problem facing the memory (or psychological connectedness) account of diachronic identity, namely the problem of branching. In this paper, I shall argue that there is no important symmetry. Whatever its other flaws may be, the awareness account is immune to the branching problem; its immunity is due to formal differences between synchronic and diachronic identity.

Branching Analysis of Spherical RRRR and Spatial RCCC Mechanisms

1986 ◽  
Vol 108 (4) ◽  
pp. 481-486 ◽  
Author(s):  
Charles F. Reinholtz ◽  
George N. Sandor ◽  
Joseph Duffy
Keyword(s):  
The Other ◽  
Optimization Scheme ◽  
Design Task ◽  
Position Analysis ◽  
Branching Problem

Most mechanisms can be assembled in two or more distinct configurations for a given position of the input link. Each distinct configuration is called a branch. When the prescribed positions of a synthesized mechanism lie on more than one branch, the mechanism is said to have branching problems or to suffer from “branch defect.” Usually, branching problems will render a mechanism unsuitable for the design task because the mechanism must be moved to the other branch during the course of motion. In most cases, this would require disassembly and reassembly of the mechanism. In this paper, conditions are developed for avoiding the branching problem in the spherical RRRR and spatial RCCC mechanisms. These conditions are ideally suited for incorporation into an optimization scheme as constraints because they do not require iterative calculations or a position analysis of the mechanism.

scholarly journals Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem

2009 ◽  
pp. 37-46 ◽  
Author(s):  
Nathann Cohen ◽  
Fedor V. Fomin ◽  
Gregory Gutin ◽  
Eun Jung Kim ◽  
Saket Saurabh ◽  
...  
Keyword(s):  
Branching Problem
Sign in / Sign up

Export Citation Format

Share Document