Foley, J.D., Dam, A. van, Feiner, S.K., andHug hes, J.F.," Computerg raphics, principles and practice, 2nd edition in C", Addison-Wesley, London, 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....perpendicular to it, # = # # 2, e find a number of candidate positions, hich follo from minima of a 1D matching cost function. We combine candidate positions on the two axes exhaustively, andg enerate the expected line pattern for each candidate poseusing standard imag e formation methods [6,8]. We then calculate the matching cost between the measured lines m i and the expected line pattern e j (c k ) for each candidate pose c k . For each measured line seg ent m i , we determine the distance D from its center point q i to the closest expected line, and combine these distances to gw a ....

Foley, J.D., Dam, A. van, Feiner, S.K., andHug hes, J.F.," Computerg raphics, principles and practice, 2nd edition in C", Addison-Wesley, London, 1996.

....perpendicular to it, # = # # 2, we find a number of candidate positions, which follow from minima of a 1D matching cost function. We combine candidate positions on the two axes exhaustively, and generate the expected line pattern for each candidate pose using standard image formation methods [6, 8]. We then calculate the matching cost between the measured lines m i and the expected line pattern e j (c k ) for each candidate pose c k . For each measured line segment m i , we determine the distance D from its center point q i to the closest expected line, and combine these distances to get a ....

Foley, J.D., Dam, A. van, Feiner, S.K., andHug hes, J.F.," Computerg raphics, principles and practice, 2nd edition in C", Addison-Wesley, London, 1996.

....the segmentation. The Euclidian distance measure and the smoothness measure can be assumed to be implemented directly from the description in section 3.4. The external energy function computes the discrete line segment between each successive vertex using the midpoint line drawing algorithm [29]. For each discrete point on the line, the dot product between the unit normal orthogonal to the line and the image gradient is taken and summed. The sum becomes the external gradient energy for those two pixels. Once the minimum has been found, the resulting minimizing set of vertices n v v , ....

James D. Foley, Stephen Feiner, Andries Van Dame, Hughes, "Computer Graphics: Principles and Practice, 2 nd Edition". Addison-Wesley, 1996.

....solid modelling at the other [Miller 1986] The main idea behind functional solid modelling is the requirement of a wide range of extremely precise information. On the other hand, in free from modelling only the aesthetics of the final shape matters [Gain 1996] 1.2. Solid versus Surface Models [Foley et al. 1993] describes a model in general as a representation of some (not necessarily all) features of a concrete or abstract entity. The purpose of a model of an entity is to allow people to visualize and understand the structure or behaviour of the entity, and to provide a convenient vehicle for ....

....as a representation of some (not necessarily all) features of a concrete or abstract entity. The purpose of a model of an entity is to allow people to visualize and understand the structure or behaviour of the entity, and to provide a convenient vehicle for experimentation with . the model . [Foley 1993] goes on to define a solid model as a closed volume bounded by planes, surfaces, or any other structure. Its boundary must be continuous and closed. No holes or improper intersections are allowed. This puts a restriction on the design of a tool intended to create solid models. Sometimes one needs ....

[Article contains additional citation context not shown here]

Foley J., Van Dam A., Freiner S. and Hughes J.(1993) Computer Graphics: Principles and Practice [2nd Ed, 5th Printing]. AddisonWesley Publishing Company.

....algorithms and interfaces. 1.2.1 Representation A Representation is a means of encoding the shape of a solid object. Some modelling systems may capture properties such as colour and texture, but for free form design, shape is sufficient. There are four principle categories of representations [Foley et al. 1991]: 1. Boundary Representations (B Reps) Here, an object is defined by its topological boundary and the internal structure is ignored. B Reps may be either Polyhedral, where the surface is a faceted approximation composed of adjoining polygons, or Non Polyhedral, where the surface is sewn from ....

....progressively more costly from linear (1 addition) to cubic B Splines (10 multiplications and 8 additions) 2.1.2 Other Splines Splines are a field of intense interest and frenetic research. There are many extensions to Uniform B Splines, for instance Non Uniform Rational B Splines (NURBS) [Foley et al. 1991], which relax the uniform unit interval restriction and are much in vogue, as well as fi Splines [Bartels et al. 1987] which introduce bias and tension parameters. Their collective purpose is to allow finer control over the curve and increase the diversity of shape and continuity. However, these ....

[Article contains additional citation context not shown here]

Foley J., Van Dam A., Feiner S. and Hughes J. (1991) Computer Graphics: Principles and Practice [2nd ed]. Addison-Wesley Publishing Company.

No context found.

FOLE90 Foley, J.D., A.van Dam, S.K.Feiner, J.F.Hughes, "Computer Graphics: Principles and Practice (2nd edition)", Addison-Wesley, 1990.

No context found.

FOLE90 Foley, J.D., A. van Dam, S.K. Feiner and J.F. Hughes, "Computer Graphics: Principles and Practice (2nd edition)", Addison-Wesley, 1990.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC