scholarly journals Expansion properties for finite subdivision rules I

2018 ◽  
Vol 61 (12) ◽  
pp. 2237-2266
Author(s):  
William J. Floyd ◽  
Walter R. Parry ◽  
Kevin M. Pilgrim
Keyword(s):  
2009 ◽  
Vol 141 (1) ◽  
pp. 181-195 ◽  
Author(s):  
J. W. Cannon ◽  
W. J. Floyd ◽  
W. R. Parry ◽  
K. M. Pilgrim
Keyword(s):  

2016 ◽  
Vol 41 (04) ◽  
pp. 939-955 ◽  
Author(s):  
Carol M. Rose

Racially restrictive covenants—subdivision rules or neighborhood agreements that “run with the land” to bar sales of rentals by minority members—were common and legally enforceable in the United States in the first half of the twentieth century. In spite of their demeaning character, these racial covenants took away opportunities from excluded minorities, rather than things, and thus they amounted to something less than the dramatic “dignity takings” that Bernadette Atuahene (2014) describes in her new book on dignity takings in South Africa. In this article, I explore some significant ways in which racially restrictive covenants differed from dignity takings as Atuahene defines them, as well as the shadowy similarities between racial covenants and Atuahene's dignity takings; I focus here on the dimensions of dehumanization, state involvement, and property takings. I conclude with a discussion of remedies, particularly considering measures that restore dignity through both public policies and private actions.


Author(s):  
J. W. Cannon ◽  
W. J. Floyd ◽  
W. R. Parry

2012 ◽  
Vol 220-223 ◽  
pp. 2458-2461
Author(s):  
Kai Bo Guo ◽  
Ming Di Wang ◽  
Cheng Feng Sun ◽  
Shi Hong Shi

The efficient implementation of Boolean operatio between STL models is a bottleneck problem to develop excellent RP data processing software, and the subdivision of the intersection is an important step of realization the Boolean operations. An algorithm is proposed in this paper. Based on the closed character of the STL model, the position relationship between the intersection lines and the triangle are classified, and the subdivision rules is summarized. The two data linked list of the intersection points and vertex points are created, a searching process to obtain the subdivision polygon is described.


Author(s):  
Svenja Hüning ◽  
Johannes Wallner

Abstract We analyse the convergence of nonlinear Riemannian analogues of linear subdivision processes operating on data in the sphere. We show how for curve subdivision rules we can derive bounds guaranteeing convergence if the density of input data is below that threshold. Previous results only yield thresholds that are several magnitudes smaller and are thus useless for a priori checking of convergence. It is the first time that such a result has been shown for a geometry with positive curvature and for subdivision rules not enjoying any special properties like being interpolatory or having non-negative mask.


Author(s):  
Shanglong Wang ◽  
Kwun-Lon Ting

This paper proposes a subdivision scheme that is capable of expressing arcs and circles in a consistent form. This curve scheme is based on the unified subdivision rules for cubic B-splines, splines-in-tension, and some trigonometric splines that are capable of generating circles. The most important feature of the scheme is to change the end point rule such that the end points are forced to locate on lines connecting the center to the start point as well as the end point. With the proposed scheme, generating arcs and circles also becomes much more intuitive.


2010 ◽  
Vol 34 (2) ◽  
pp. 201-218 ◽  
Author(s):  
Johannes Wallner ◽  
Esfandiar Nava Yazdani ◽  
Andreas Weinmann

Sign in / Sign up

Export Citation Format

Share Document