An Efficient Algorithm for Determining an Aesthetic Shape Connecting Unorganized 2D Points

We present anefficient algorithm for determining an aesthetically pleasing shape boundary connecting all the points in a given unorganized set of 2D points, with no other information than point coordinates. By posing shape construction as a minimisation problem which follows the Gestalt laws, our desired shape is non‐intersecting, interpolates all points and minimizes a criterion related to these laws. The basis for our algorithm is an initial graph, an extension of the Euclidean minimum spanning tree but with no leaf nodes, called as the minimum boundary complex . and can be expressed similarly by parametrizing a topological constraint. A close approximation of , termed can be computed fast using a greedy algorithm. is then transformed into a closed interpolating boundary in two steps to satisfy ’s topological and minimization requirements. Computing exactly is an NP (Non‐Polynomial)‐hard problem, whereas is computed in linearithmic time. We present many examples showing considerable improvement over previous techniques, especially for shapes with sharp corners. Source code is available online.     

Surface Patches from Unorganized Space Curves

Recent 3D sketch tools produce networks of three‐space curves that suggest the contours of shapes. The shapes may be non‐manifold, closed three‐dimensional, open two‐dimensional, or mixed. We describe a system that automatically generates intuitively appealing piecewise‐smooth surfaces from such a curve network, and an intelligent user interface for modifying the automatically chosen surface patches. Both the automatic and the semi‐automatic parts of the system use a linear algebra representation of the set of surface patches to track the topology. On complicated inputs from ILoveSketch [ [BBS08] ], our system allows the user to build the desired surface with just a few mouse‐clicks.     

G2 Tensor Product Splines over Extraordinary Vertices

We present a second order smooth filling of an n‐valent Catmull‐Clark spline ring with n biseptic patches. While an underdetermined biseptic solution to this problem has appeared previously, we make several advances in this paper. Most notably, we cast the problem as a constrained minimization and introduce a novel quadratic energy functional whose absolute minimum of zero is achieved for bicubic polynomials. This means that for the regular 4‐valent case, we reproduce the bicubic B‐splines. In other cases, the resulting surfaces are aesthetically well behaved. We extend our constrained minimization framework to handle the case of input mesh with boundary.     

Motorcycle Graphs: Canonical Quad Mesh Partitioning

We describe algorithms for canonically partitioning semi‐regular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein and Erickson to quad meshes. Our partitions may be used to efficiently find isomorphisms between quad meshes. In addition, they may be used as a highly compressed representation of the original mesh. These partitions can be constructed in sublinear time from a list of the extraordinary vertices in a mesh. We also study the problem of further reducing the number of submeshes in our partitions—we prove that optimizing this number is NP‐hard, but it can be efficiently approximated.     

Orientalism in Euro-American and Indian psychology: Historical representations of "natives" in colonial and postcolonial contexts.

The author examines the historical role of Euro-American psychology in constructing Orientalist representations of the natives who were colonized by the European colonial powers. In particular, the author demonstrates how the power to represent the non-Western "Other" has always resided, and still continues to reside, primarily with psychologists working in Europe and America. It is argued that the theoretical frameworks that are used to represent non-Westerners in contemporary times continue to emerge from Euro-American psychology. Finally, the author discusses how non-Western psychologists internalized these Orientalist images and how such a move has led to a virtual abandonment of pursuing "native" forms of indigenous psychologies in Third World psychology departments. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Children's understanding of the knowledge prerequisites of drawing and pretending.

Many young children will claim that someone is pretending to be something even when the person does not know what that something is. To examine whether children's failure to take knowledge prerequisites into account is part of a more fundamental problem in recognizing how mental representations constrain external ones, the authors asked children whether an artist who did not know what something was, yet whose drawing bore resemblance to it, was drawing it. The same questions were asked regarding pretending. Children performed similarly on pretending and drawing questions, and performance on both questions improved when the protagonists' point of view was emphasized. Performance for drawing improved somewhat when alternative goals were stated. Further, cross-sectional data indicated that understanding how knowledge relates to producing external representations increases gradually from age 4 to age 8, suggesting that experiential factors may be crucial to this understanding. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Object trimming: When masking dots alter rather than replace target representations.

Five experiments demonstrate that when dots appear beside a briefly presented target object, and persist on view longer than the target, the flanked object is perceptually altered by the dots. Three methods are used to explore this object trimming effect. Experiments 1–3 assess participants’ conscious reports of trimmed digits, Experiment 4 uses repetition priming to explore the target representation, and Experiment 5 examines the perception of apparent motion in trimmed targets. Results of all three methods indicate that object trimming is influenced by mechanisms of perceptual grouping that operate on target representations prior to conscious access. Separate contributions from visual crowding and backward masking are also identified. These results imply that common-onset masking does not always result from the target being substituted by the mask, but that target and mask can sometimes maintain separate mental representations. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Localized Delaunay Refinement for Sampling and Meshing

The technique of Delaunay refinement has been recognized as a versatile tool to generate Delaunay meshes of a variety of geometries. Despite its usefulness, it suffers from one lacuna that limits its application. It does not scale well with the mesh size. As the sample point set grows, the Delaunay triangulation starts stressing the available memory space which ultimately stalls any effective progress. A natural solution to the problem is to maintain the point set in clusters and run the refinement on each individual cluster. However, this needs a careful point insertion strategy and a balanced coordination among the neighboring clusters to ensure consistency across individual meshes. We design an octtree based localized Delaunay refinement method for meshing surfaces in three dimensions which meets these goals. We prove that the algorithm terminates and provide guarantees about structural properties of the output mesh. Experimental results show that the method can avoid memory thrashing while computing large meshes and thus scales much better than the standard Delaunay refinement method.