Skip to main navigation
Skip to search
Skip to main content
University of Copenhagen Research Portal Home
Help & FAQ
Dansk
English
Home
Profiles
Research output
Research units
Press/Media
Activities
Prizes
???studenttheses???
Datasets
Search by expertise, name or affiliation
Finding the maximum subset with bounded convex curvature
Mikkel Abrahamsen
,
Mikkel Thorup
Department of Computer Science
1
Citation (Scopus)
67
Downloads (Pure)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Finding the maximum subset with bounded convex curvature'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Anticlockwise
31%
Arbitrary
11%
Arc of a curve
17%
Closed curve
23%
Computer Aided Manufacturing
36%
Connected Set
50%
Correctness
21%
Curvature
100%
Curve
13%
Generalization
10%
Line segment
22%
Machining
61%
Maximise
20%
Output
15%
Polygon
19%
Radius
17%
Requirements
17%
Rough
41%
Set of points
19%
Steel
25%
Subset
71%
Theorem
8%
Tool Path
38%