10.9k citations
- University of OklahomaUS1.3k papers
- University of ChicagoUS1.3k papers
- Southern Methodist UniversityUS1.3k papers
- University of Illinois Urbana-ChampaignUS1.3k papers
- McGill UniversityCA1.3k papers
- The Ohio State UniversityUS1.3k papers
- University of PittsburghUS1.3k papers
- University of British ColumbiaCA1.2k papers
- Rutherford Appleton LaboratoryGB1.2k papers
- European Organization for Nuclear ResearchCH1.2k papers
- University of AlbertaCA1.2k papers
- University of OxfordGB1.2k papers
5 papers · 2 filters
Computing a visibility polygon using few variables
Luis Barba, Matias Korman, Stefan Langerman +1
We present several algorithms for computing the visibility polygon of a simple polygon from a viewpoint inside the polygon, when the polygon resides in read-only memory and onl…
Localized Geometric Query Problems
John Augustine, Sandip Das, Anil Maheshwari +3
A new class of geometric query problems are studied in this paper. We are required to preprocess a set of geometric objects in the plane, so that for any arbitrary query point…
Making triangulations 4-connected using flips
Prosenjit Bose, Dana Jansens, André van Renssen +2
We show that any combinatorial triangulation on n vertices can be transformed into a 4-connected one using at most floor((3n - 9)/5) edge flips. We also give an example of an infin…
Automatically Creating Design Models from 3D Anthropometry Data
Stefanie Wuhrer, Chang Shu, Prosenjit Bose
When designing a product that needs to fit the human shape, designers often use a small set of 3D models, called design models, either in physical or digital form, as representativ…
An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains
Lyudmil Aleksandrov, Hristo Djidjev, Anil Maheshwari +1
We present the first polynomial time approximation algorithm for computing shortest paths in weighted three-dimensional domains. Given a polyhedral domain $\D$, consisting of t…