#### Filter Results:

- Full text PDF available (41)

#### Publication Year

1995

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Joe D. Warren, Scott Schaefer, Anil N. Hirani, Mathieu Desbrun
- Adv. Comput. Math.
- 2007

In this paper we provide an extension of barycentric coordinates from simplices to arbitrary convex sets. Barycentric coordinates over convex 2D polygons have found numerous applications in various fields as it allows smooth interpolation of data located on vertices. However, no explicit formulation valid for arbitrary convex polytopes has been proposed to… (More)

- Yiying Tong, Santiago V. Lombeyda, Anil N. Hirani, Mathieu Desbrun
- ACM Trans. Graph.
- 2003

While 2D and 3D vector fields are ubiquitous in computational sciences, their use in graphics is often limited to regular grids, where computations are easily handled through finite-difference methods. In this paper, we propose a set of simple and accurate tools for the analysis of 3D discrete vector fields on arbitrary tetrahedral grids. We introduce a… (More)

- Anil N. Hirani, Takashi Totsuka
- SIGGRAPH
- 1996

Scratches on old films must be removed since these are more noticeable on higher definition and digital televisions. Wires that suspend actors or cars must be carefully erased during post production of special effects shots. Both of these are time consuming tasks but can be addressed by the following image restoration process: given the locations of noisy… (More)

- Nathan M. Dunfield, Anil N. Hirani
- Symposium on Computational Geometry
- 2011

Two fundamental objects in knot theory are the minimal genus surface and the least area surface bounded by a knot in a 3-dimensional manifold. When the knot is embedded in a general 3-manifold, the problems of finding these surfaces were shown to be NP-complete and NP-hard respectively. However, there is evidence that the special case when the ambient… (More)

Given a set of alternatives to be ranked, and some pairwise comparison data, ranking is a least squares computation on a graph. The vertices are the alternatives, and the edge values comprise the comparison data. The basic idea is very simple and old – come up with values on vertices such that their differences match the given edge data. Since an exact… (More)

- Alan Demlow, Anil N. Hirani
- Foundations of Computational Mathematics
- 2014

Finite element exterior calculus (FEEC) has been developed over the past decade as a framework for constructing and analyzing stable and accurate numerical methods for partial differential equations by employing differential complexes. The recent work of Arnold, Falk, and Winther includes a well-developed theory of finite element methods for Hodge–Laplace… (More)

- Eitan Grinspun, Anil N. Hirani, Mathieu Desbrun, Peter Schröder
- Symposium on Computer Animation
- 2003

In this paper we introduce a discrete shell model describing the behavior of thin flexible structures, such as hats, leaves, and aluminum cans, which are characterized by a curved undeformed configuration. Previously such models required complex continuum mechanics formulations and correspondingly complex algorithms. We show that a simple shell model can be… (More)

— This paper demonstrates how discrete exterior calculus tools may be useful in computer vision and graphics. A variational approach provides a link with mechanics.

- Evan VanderZee, Anil N. Hirani, Vadim Zharnitsky, Damrong Guoy
- Comput. Geom.
- 2010

It is shown that there exists a dihedral acute triangulation of the three-dimensional cube. The method of constructing the acute triangulation is described, and symmetries of the trian-gulation are discussed.

- Nathan Bell, Anil N. Hirani
- ACM Trans. Math. Softw.
- 2012

This article describes the algorithms, features, and implementation of PyDEC, a Python library for computations related to the discretization of exterior calculus. PyDEC facilitates inquiry into both physical problems on manifolds as well as purely topological problems on abstract complexes. We describe efficient algorithms for constructing the operators… (More)