Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Ainesh Chatterjee

dblp:372/2712 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Computational geometry · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational geometry › convex geometry
convex polygon
0.812024
Ipelets for the Convex Polygonal Geometry (Media Exposition) · SoCG 2024
Computational geometry
metric geometry
0.812024
Ipelets for the Convex Polygonal Geometry (Media Exposition) · SoCG 2024
Computational geometry › geometric modeling and processing
minkowski sum
0.812024
Ipelets for the Convex Polygonal Geometry (Media Exposition) · SoCG 2024
Computational geometry
visualization
0.812024
Ipelets for the Convex Polygonal Geometry (Media Exposition) · SoCG 2024
YearPublicationVenuePosition
2024 Ipelets for the Convex Polygonal Geometry (Media Exposition)
abstract
There are many structures, both classical and modern, involving convex polygonal geometries whose deeper understanding would be facilitated through interactive visualizations. The Ipe extensible drawing editor, developed by Otfried Cheong, is a widely used software system for generating geometric figures. One of its features is the capability to extend its functionality through programs called Ipelets. In this media submission, we showcase a collection of new Ipelets that construct a variety of geometric objects based on polygonal geometries. These include Macbeath regions, metric balls in the forward and reverse Funk distance, metric balls in the Hilbert metric, polar bodies, the minimum enclosing ball of a point set, and minimum spanning trees in both the Funk and Hilbert metrics. We also include a number of utilities on convex polygons, including union, intersection, subtraction, and Minkowski sum (previously implemented as a CGAL Ipelet). All of our Ipelets are programmed in Lua and are freely available.
Nithin Parepally, Ainesh Chatterjee, Auguste H. Gezalyan, Hongyang Du 0002, Sukrit Mangla, Kenny Wu, Sarah Hwang, David M. Mount
SoCG2