Open Access. Powered by Scholars. Published by Universities.®
Graphics and Human Computer Interfaces Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
Articles 1 - 2 of 2
Full-Text Articles in Graphics and Human Computer Interfaces
Principles Of Anti-Discriminatory Design, D. E. Wittkower
Principles Of Anti-Discriminatory Design, D. E. Wittkower
Philosophy Faculty Publications
Technical design can produce exclusionary and even discriminatory effects for users. A lack of discriminatory intent is insufficient to avoid discriminatory design, since implicit assumptions about users rarely include all relevant user demographics, and in some cases, designing for all relevant users is actually impossible. To minimize discriminatory effects of technical design, an actively anti-discriminatory design perspective must be adopted. This article provides examples of discriminatory user exclusion, then defining exclusionary design in terms of disaffordances and dysaffordances. Once these definitions are in place, principles of anti-discriminatory design are advanced, drawing upon a method of phenomenological variation employed in the …
Watertight And 2-Manifold Surface Meshes Using Dual Contouring With Tetrahedral Decomposition Of Grid Cubes, Tanweer Rashid, Sharmin Sultana, Michel A. Audette
Watertight And 2-Manifold Surface Meshes Using Dual Contouring With Tetrahedral Decomposition Of Grid Cubes, Tanweer Rashid, Sharmin Sultana, Michel A. Audette
Computational Modeling & Simulation Engineering Faculty Publications
The Dual Contouring algorithm (DC) is a grid-based process used to generate surface meshes from volumetric data. The advantage of DC is that it can reproduce sharp features by inserting vertices anywhere inside the grid cube, as opposed to the Marching Cubes (MC) algorithm that can insert vertices only on the grid edges. However, DC is unable to guarantee 2-manifold and watertight meshes due to the fact that it produces only one vertex for each grid cube. We present a modified Dual Contouring algorithm that is capable of overcoming this limitation. Our method decomposes an ambiguous grid cube into a …