The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The well-known marching cubes algorithm is modified to apply to the face-centered cubic (fee) grid. Thus, the local configurations that are considered when extracting the local surface patches are not cubic anymore. This paper presents three different partitionings of the fee grid to be used for the local configurations. The three candidates are evaluated theoretically and experimentally and compared...
In this paper, we proposed an improved version of the marching cube algorithm which gives a topologically correct triangular approximation of the isosurface for any cube configuration. First, a classification and characterization of critical points on the isosurface of trilinear functions is studied in detail. Then, unlike the past work on marching cube algorithm, a robust triangulation strategy without...
We present a new algorithm for computing a polygonal surface from a union of balls. The method computes and connects the singular points of a given union of balls in an efficient manner to approximate the boundary. The algorithm uses the dual shape of the balls to give the resulting surface the correct topology. Our method is simple and demonstrated to be robust
The paper examines the implications for topology of implementing geometrical algorithms in a floating point number system. It uses fuzzy logic to define a discriminator function which can then be used in point classification, the classification itself being defined in terms of the logic of partial functions. This is then applied to the problem of a triple line intersection, and is used to validate...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.