default search action
Anil N. Hirani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j16]Mark D. Schubel, Daniel Berwick-Evans, Anil N. Hirani:
Averaging property of wedge product and naturality in discrete exterior calculus. Adv. Comput. Math. 50(4): 84 (2024) - 2023
- [j15]Anil N. Hirani, Kaushik Kalyanaraman, Han Wang, Seth Watts
:
Computing discrete harmonic differential forms in a given cohomology class using finite element exterior calculus. Comput. Geom. 109: 101937 (2023) - [j14]Minmiao Wang, Pankaj Jagad, Anil N. Hirani, Ravi Samtaney
Discrete exterior calculus discretization of two-phase incompressible Navier-Stokes equations with a conservative phase field method. J. Comput. Phys. 488: 112245 (2023) - [i18]Daniel Berwick-Evans, Anil N. Hirani, Mark D. Schubel:
Averaging Property of Wedge Product and Naturality in Discrete Exterior Calculus. CoRR abs/2310.00725 (2023) - 2021
- [i17]Daniel Berwick-Evans, Anil N. Hirani, Mark D. Schubel:
Discrete Vector Bundles with Connection and the Bianchi Identity. CoRR abs/2104.10277 (2021) - [i16]Vaibhav Karve, Anil N. Hirani:
GraphSAT - a decision problem connecting satisfiability and graph theory. CoRR abs/2105.11390 (2021) - [i15]Anil N. Hirani, Andy T. S. Wan, Nikolas Wojtalewicz:
Conservative Integrators for Piecewise Smooth Systems with Transversal Dynamics. CoRR abs/2106.07484 (2021) - 2020
- [j13]Vaibhav Karve, Anil N. Hirani:
The complete set of minimal simple graphs that support unsatisfiable 2-CNFs. Discret. Appl. Math. 283: 123-132 (2020)
2010 – 2019
- 2018
- [j12]Anil N. Hirani, Kaushik Kalyanaraman, Evan VanderZee:
Corrigendum to "Delaunay Hodge star" [Comput. Aided Des. 45 (2013) 540-544]. Comput. Aided Des. 96: 59-60 (2018) - [i14]Vaibhav Karve
The complete set of minimal simple graphs that support unsatisfiable 2-CNFs. CoRR abs/1812.10849 (2018) - 2016
- [j11]Mamdouh S. Mohamed
Comparison of discrete Hodge star operators for surfaces. Comput. Aided Des. 78: 118-125 (2016) - [j10]Mamdouh S. Mohamed
Discrete exterior calculus discretization of incompressible Navier-Stokes equations over surface simplicial meshes. J. Comput. Phys. 312: 175-191 (2016) - 2015
- [c10]Anil N. Hirani, Kaushik Kalyanaraman, Seth Watts:
Graph Laplacians and Least Squares on Graphs. IPDPS Workshops 2015: 812-821 - 2014
- [j9]Alan Demlow, Anil N. Hirani:
A Posteriori Error Estimates for Finite Element Exterior Calculus: The de Rham Complex. Found. Comput. Math. 14(6): 1337-1371 (2014) - 2013
- [j8]Anil N. Hirani, Kaushik Kalyanaraman, Evan VanderZee:
Delaunay Hodge star. Comput. Aided Des. 45(2): 540-544 (2013) - [j7]Evan VanderZee, Anil N. Hirani, Damrong Guoy, Vadim Zharnitsky, Edgar A. Ramos:
Geometric and combinatorial properties of well-centered triangulations in three and higher dimensions. Comput. Geom. 46(6): 700-724 (2013) - [i13]Tamal K. Dey, Anil N. Hirani, Bala Krishnamoorthy, Gavin W. Smith:
Edge Contractions and Simplicial Homology. CoRR abs/1304.0664 (2013) - 2012
- [j6]Nathan Bell, Anil N. Hirani:
PyDEC: Software and Algorithms for Discretization of Exterior Calculus. ACM Trans. Math. Softw. 39(1): 3:1-3:41 (2012) - [i12]Anil N. Hirani, Kaushik Kalyanaraman, Evan VanderZee:
Delaunay Hodge Star. CoRR abs/1204.0747 (2012) - 2011
- [j5]Tamal K. Dey, Anil N. Hirani, Bala Krishnamoorthy:
Optimal Homologous Cycles, Total Unimodularity, and Linear Programming. SIAM J. Comput. 40(4): 1026-1044 (2011) - [c9]Nathan M. Dunfield, Anil N. Hirani:
The least spanning area of a knot and the optimal bounding chain problem. SCG 2011: 135-144 - [i11]Nathan Bell, Anil N. Hirani:
PyDEC: Software and Algorithms for Discretization of Exterior Calculus. CoRR abs/1103.3076 (2011) - [i10]Anil N. Hirani, Kaushik Kalyanaraman:
Numerical Experiments for Darcy Flow on a Surface Using Mixed Exterior Calculus Methods. CoRR abs/1103.4865 (2011) - 2010
- [j4]Evan VanderZee, Anil N. Hirani, Vadim Zharnitsky, Damrong Guoy:
A dihedral acute triangulation of the cube. Comput. Geom. 43(5): 445-452 (2010) - [j3]Evan VanderZee, Anil N. Hirani, Damrong Guoy, Edgar A. Ramos:
Well-Centered Triangulation. SIAM J. Sci. Comput. 31(6): 4497-4523 (2010) - [c8]Tamal K. Dey, Anil N. Hirani, Bala Krishnamoorthy:
Optimal homologous cycles, total unimodularity, and linear programming. STOC 2010: 221-230 - [i9]Tamal K. Dey, Anil N. Hirani, Bala Krishnamoorthy:
Optimal Homologous Cycles, Total Unimodularity, and Linear Programming. CoRR abs/1001.0338 (2010) - [i8]Anil N. Hirani, Kaushik Kalyanaraman, Seth Watts:
Least Squares Ranking on Graphs, Hodge Laplacians, Time Optimality, and Iterative Methods. CoRR abs/1011.1716 (2010) - [i7]Anil N. Hirani, Kaushik Kalyanaraman, Han Wang, Seth Watts:
Real Homology Cohomology and Harmonic Cochains, Least Squares, and Diagonal Dominance. CoRR abs/1012.2835 (2010) - [i6]Nathan M. Dunfield, Anil N. Hirani:
The Least Spanning Area of a Knot and the Optimal Bounding Chain Problem. CoRR abs/1012.3030 (2010)
2000 – 2009
- 2009
- [i5]Evan VanderZee, Anil N. Hirani, Vadim Zharnitsky, Damrong Guoy:
A Dihedral Acute Triangulation of the Cube. CoRR abs/0905.3715 (2009) - [i4]Evan VanderZee, Anil N. Hirani, Damrong Guoy, Vadim Zharnitsky, Edgar A. Ramos:
Geometric and Combinatorial Properties of Well-Centered Triangulations in Three and Higher Dimensions. CoRR abs/0912.3097 (2009) - 2008
- [c7]Evan VanderZee, Anil N. Hirani, Damrong Guoy:
Triangulation of Simple 3D Shapes with Well-Centered Tetrahedra. IMR 2008: 19-35 - [i3]Evan VanderZee, Anil N. Hirani, Damrong Guoy, Edgar A. Ramos:
Well-Centered Triangulation. CoRR abs/0802.2108 (2008) - [i2]Evan VanderZee, Anil N. Hirani, Damrong Guoy:
Triangulation of Simple 3D Shapes with Well-Centered Tetrahedra. CoRR abs/0806.2332 (2008) - [i1]Anil N. Hirani, K. B. Nakshatrala, Jehanzeb Hameed Chaudhry:
Numerical method for Darcy flow derived using Discrete Exterior Calculus. CoRR abs/0810.3434 (2008) - 2007
- [j2]Joe D. Warren, Scott Schaefer, Anil N. Hirani, Mathieu Desbrun
Barycentric coordinates for convex sets. Adv. Comput. Math. 27(3): 319-338 (2007) - [c6]Evan VanderZee, Anil N. Hirani, Damrong Guoy, Edgar A. Ramos:
Well-centered Planar Triangulation - An Iterative Approach. IMR 2007: 121-138 - 2003
- [b1]Anil N. Hirani:
Discrete Exterior Calculus. California Institute of Technology, USA, 2003 - [j1]Yiying Tong, Santiago V. Lombeyda, Anil N. Hirani, Mathieu Desbrun
Discrete multiscale vector field decomposition. ACM Trans. Graph. 22(3): 445-452 (2003) - [c5]Mathieu Desbrun
Discrete exterior calculus for variational problems in computer vision and graphics. CDC 2003: 4902-4907 - [c4]Eitan Grinspun, Anil N. Hirani, Mathieu Desbrun, Peter Schröder:
Discrete shells. Symposium on Computer Animation 2003: 62-67 - 2001
- [c3]Anil N. Hirani, Jerrold E. Marsden, James Arvo:
Averaged Template Matching Equations. EMMCVPR 2001: 528-543
1990 – 1999
- 1996
- [c2]Anil N. Hirani, Takashi Totsuka:
Dual domain interactive image restoration: basic algorithm. ICIP (1) 1996: 797-800 - [c1]Anil N. Hirani, Takashi Totsuka:
Combining Frequency and Spatial Domain Information for Fast Interactive Image Noise Removal. SIGGRAPH 1996: 269-276
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-14 23:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: