◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Iosif Pinelis

3 papers here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author2
  • last author1

Across the 3 of 3 papers where every author was matched, so the position is known.

fields
  • cs.CG1
  • math.GM1
  • math.ST1
ORCID 0000-0003-4742-5789

identity via Semantic Scholar / OpenAlex

most citedConvexity of Sub-polygons of Convex Polygons

5 citations · 9 across the 3 of their papers we have counts for

collaborators
Showing cs.CGShow all

1 paper · 1 filter

cs.CG2006★ 2 cited

Polygon Convexity: A Minimal O(n) Test

Iosif Pinelis

An O(n) test for polygon convexity is stated and proved. It is also proved that the test is minimal in a certain exact sense.

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.