| Abstract: A method is disclosed for partitioning an input polytope into a conformal
set of polytopes according to a subdivision pattern specified on
lower-dimensional boundaries of the input polytope. A feature of this
method is that it is applicable to any dimension. For input polytopes
that are hexahedra isomorphic to a 3-dimensional cube, all members of the
conforming partition will be hexahedra isomorphic to a 3-dimensional
cube. A further feature of the invention is that it preserves convexity;
a convex input polytope will result in a conformal partition comprising
convex polytopes. Finally, the method may be used to process large
conformal meshes of input polytopes in parallel and produce a globally
conformal partition without the requirement of communication between
processes. |
| Filed: 6/2/2009 |
| Application Number: 12/476335 |
| This invention was made with Government support under Contract No. DE-NA0003525 awarded by the United States Department of Energy/National Nuclear Security Administration. The Government has certain rights in the invention. |
| Attribution for Derwent World Patents Index Records published on Sandia ® Clarivate. All rights reserved. Republication or redistribution of Clarivate content, including by framing or similar means, is prohibited without the prior written consent of Clarivate. Clarivate and its logo, as well as all other trademarks used herein are trademarks of their respective owners and used under license. |