SlideShare a Scribd company logo
1 of 36
Download to read offline
Characterizing the Distortion of
Some Simple Euclidean
Embeddings
Jonathan Lenchner*, Krzysztof P. Onak*, Don Sheehy**, and Liu Yang*
!
!
*IBM
**University of Connecticut
Finite Euclidean Metrics
Finite Point Sets in Euclidean Space
Treat the point set P as a
finite metric space (P,d).
d(p, q) := kp qk =
q
(px qx)2 + (py qy)2
Embeddings and Distortion
P
Embeddings and Distortion
P Q
Embeddings and Distortion
P Q
Let ⇧ : P ! Q be a bijection.
⇧ is t-Lipschitz if d(p, q) < t d(⇧(p), ⇧(q))
for all p, q 2 P.
Embeddings and Distortion
P Q
Let ⇧ : P ! Q be a bijection.
⇧ is t-Lipschitz if d(p, q) < t d(⇧(p), ⇧(q))
for all p, q 2 P.
The distortion of ⇧ is the min t such that
⇧ and ⇧ 1
are t-Lipschitz.
Embeddings and Distortion
P Q
Let ⇧ : P ! Q be a bijection.
⇧ is t-Lipschitz if d(p, q) < t d(⇧(p), ⇧(q))
for all p, q 2 P.
The distortion of ⇧ is the min t such that
⇧ and ⇧ 1
are t-Lipschitz.
Dist(⇧) := maxp,q2P max( d(p,q)
d(⇧(p),⇧(q)) , d(⇧(p),⇧(q))
d(p,q) )
Lower Bounds [Badiou et al.]
Embedding n evenly spaced points on a circle
into a line requires ⌦(
p
n) distortion.
Lower Bounds [Badiou et al.]
Embedding n evenly spaced points on a circle
into a line requires ⌦(
p
n) distortion.
Lower Bounds [Badiou et al.]
Proof Idea:
Lipschitz Extensions
Borsuk-Ulam Theorem
Embedding n evenly spaced points on a circle
into a line requires ⌦(
p
n) distortion.
Lower Bounds [Badiou et al.]
Proof Idea:
Lipschitz Extensions
Borsuk-Ulam Theorem
Embedding n evenly spaced points on a circle
into a line requires ⌦(
p
n) distortion.
⌦(n1/4
) distortion for
embedding a sphere
into a plane.
Embedding in Pairs of Lines
Embedding in Pairs of Lines
Gap 1
2n
Embedding in Pairs of Lines
Between lines  1
2
p
n
Gap 1
2n
Embedding in Pairs of Lines
Between lines  1
2
p
n
Gap 1
2n
Resulting distortion is ⇥(
p
n)
Embedding in Pairs of Lines
Between lines  1
2
p
n
Gap 1
2n
Resulting distortion is ⇥(
p
n)
Distortion is ⇥(n1/4
)
for embedding
sphere to two planes.
Embedding in Triples of Lines
Embedding in Triples of Lines
Embedding in Triples of Lines
Embedding in Triples of Lines
Distortion is constant.
Embedding in Triples of Lines
Distortion is constant.
Similarly, embedding points a on sphere to 4 planes can also be done
with constant distortion.
!
Open: What about embedding into 3 planes?
One Point Off the Line/Plane
q
p
a
b
One Point Off the Line/Plane
p
n
q
p
a
b
One Point Off the Line/Plane
p
n
Distortion O(n1/4
) is possible.
q
p
a
b
One Point Off the Line/Plane
Lemma
Consider a collection of n points on a line, each point one unit from the next,
together with one additional point at height
p
n above the center point of the
points on the line. Then any embedding of these points into a line has distortion
⌦(n1/4
)
p
n
Distortion O(n1/4
) is possible.
q
p
a
b
One Point Off the Line/Plane
Lemma
Consider a collection of n points on a line, each point one unit from the next,
together with one additional point at height
p
n above the center point of the
points on the line. Then any embedding of these points into a line has distortion
⌦(n1/4
)
p
n
Distortion O(n1/4
) is possible.
Proof Idea:
If q is not on one end after the embedding, then it forces two adjacent points
to be stretched. Otherwise, the n/4 nearest points on the line to q must be
from the middle half. It follows that a or b separates a pair of adjacent
points from the middle half.
q
p
a
b
One Point Off the Line/Plane
p
n
q
p
a
b
q
Case 1: If q is not on the end, it separates c,d (previously adjacent pts).
c
d
One Point Off the Line/Plane
p
n
q
p
a
b
middle half
q
Case 2: If q is on the end, either a or b separates c, d (previously
adjacent pts from middle half).
c
d
a
The n/4 points closest to q must all be from the middle half.
Otherwise, dist(q,p) is stretched
Open Questions
Open Questions
Lower bounds for embedding into pairs of lines/planes.
Open Questions
Lower bounds for embedding into pairs of lines/planes.
Extensions to measures and expected distortion.
Open Questions
Lower bounds for embedding into pairs of lines/planes.
Extensions to measures and expected distortion.
Bounds on embedding points on a sphere into 3 planes.
Open Questions
Lower bounds for embedding into pairs of lines/planes.
Extensions to measures and expected distortion.
Bounds on embedding points on a sphere into 3 planes.
Upper bounds for one point off the line/plane.
Open Questions
Lower bounds for embedding into pairs of lines/planes.
Extensions to measures and expected distortion.
Bounds on embedding points on a sphere into 3 planes.
Upper bounds for one point off the line/plane.
Lower bounds for one point off a hyperplane in d>3.
Open Questions
Thanks.
Lower bounds for embedding into pairs of lines/planes.
Extensions to measures and expected distortion.
Bounds on embedding points on a sphere into 3 planes.
Upper bounds for one point off the line/plane.
Lower bounds for one point off a hyperplane in d>3.
Characterizing the Distortion of Some Simple Euclidean Embeddings

More Related Content

What's hot

Skiena algorithm 2007 lecture12 topological sort connectivity
Skiena algorithm 2007 lecture12 topological sort connectivitySkiena algorithm 2007 lecture12 topological sort connectivity
Skiena algorithm 2007 lecture12 topological sort connectivityzukun
 
Unit 2 power point
Unit 2 power pointUnit 2 power point
Unit 2 power pointvalbear
 
10. polar coordinates x
10. polar coordinates x10. polar coordinates x
10. polar coordinates xharbormath240
 
Applied Calculus Chapter 1 polar coordinates and vector
Applied Calculus Chapter  1 polar coordinates and vectorApplied Calculus Chapter  1 polar coordinates and vector
Applied Calculus Chapter 1 polar coordinates and vectorJ C
 
Algorithm Design and Complexity - Course 12
Algorithm Design and Complexity - Course 12Algorithm Design and Complexity - Course 12
Algorithm Design and Complexity - Course 12Traian Rebedea
 
Write a program to draw a cubic Bezier curve.
Write a program to draw a cubic Bezier curve. Write a program to draw a cubic Bezier curve.
Write a program to draw a cubic Bezier curve. Shobhit Saxena
 
Totally R*-Continuous and Totally R*-Irresolute Functions
Totally R*-Continuous and Totally R*-Irresolute FunctionsTotally R*-Continuous and Totally R*-Irresolute Functions
Totally R*-Continuous and Totally R*-Irresolute Functionsinventionjournals
 
Probabilistic diameter and its properties.
Probabilistic diameter and its properties.Probabilistic diameter and its properties.
Probabilistic diameter and its properties.inventionjournals
 
11. polar equations and graphs x
11. polar equations and graphs x11. polar equations and graphs x
11. polar equations and graphs xharbormath240
 
Shortest path algorithm
Shortest path algorithmShortest path algorithm
Shortest path algorithmsana younas
 
Open newton cotes quadrature with midpoint derivative for integration of al...
Open newton   cotes quadrature with midpoint derivative for integration of al...Open newton   cotes quadrature with midpoint derivative for integration of al...
Open newton cotes quadrature with midpoint derivative for integration of al...eSAT Journals
 
11.1 Sequences and Series
11.1 Sequences and Series11.1 Sequences and Series
11.1 Sequences and Seriessmiller5
 
B field conducting sphere
B field conducting sphereB field conducting sphere
B field conducting sphereFFMdeMul
 

What's hot (20)

Unit circle
Unit circleUnit circle
Unit circle
 
Skiena algorithm 2007 lecture12 topological sort connectivity
Skiena algorithm 2007 lecture12 topological sort connectivitySkiena algorithm 2007 lecture12 topological sort connectivity
Skiena algorithm 2007 lecture12 topological sort connectivity
 
Temporal graph
Temporal graphTemporal graph
Temporal graph
 
SINGLE-SOURCE SHORTEST PATHS
SINGLE-SOURCE SHORTEST PATHS SINGLE-SOURCE SHORTEST PATHS
SINGLE-SOURCE SHORTEST PATHS
 
Chelly unit 2
Chelly unit 2Chelly unit 2
Chelly unit 2
 
Unit 2 power point
Unit 2 power pointUnit 2 power point
Unit 2 power point
 
10. polar coordinates x
10. polar coordinates x10. polar coordinates x
10. polar coordinates x
 
Applied Calculus Chapter 1 polar coordinates and vector
Applied Calculus Chapter  1 polar coordinates and vectorApplied Calculus Chapter  1 polar coordinates and vector
Applied Calculus Chapter 1 polar coordinates and vector
 
Unit 2 power point
Unit 2 power pointUnit 2 power point
Unit 2 power point
 
Algorithm Design and Complexity - Course 12
Algorithm Design and Complexity - Course 12Algorithm Design and Complexity - Course 12
Algorithm Design and Complexity - Course 12
 
Write a program to draw a cubic Bezier curve.
Write a program to draw a cubic Bezier curve. Write a program to draw a cubic Bezier curve.
Write a program to draw a cubic Bezier curve.
 
Totally R*-Continuous and Totally R*-Irresolute Functions
Totally R*-Continuous and Totally R*-Irresolute FunctionsTotally R*-Continuous and Totally R*-Irresolute Functions
Totally R*-Continuous and Totally R*-Irresolute Functions
 
Amplitude and period
Amplitude and periodAmplitude and period
Amplitude and period
 
Data structure
Data structureData structure
Data structure
 
Probabilistic diameter and its properties.
Probabilistic diameter and its properties.Probabilistic diameter and its properties.
Probabilistic diameter and its properties.
 
11. polar equations and graphs x
11. polar equations and graphs x11. polar equations and graphs x
11. polar equations and graphs x
 
Shortest path algorithm
Shortest path algorithmShortest path algorithm
Shortest path algorithm
 
Open newton cotes quadrature with midpoint derivative for integration of al...
Open newton   cotes quadrature with midpoint derivative for integration of al...Open newton   cotes quadrature with midpoint derivative for integration of al...
Open newton cotes quadrature with midpoint derivative for integration of al...
 
11.1 Sequences and Series
11.1 Sequences and Series11.1 Sequences and Series
11.1 Sequences and Series
 
B field conducting sphere
B field conducting sphereB field conducting sphere
B field conducting sphere
 

Similar to Characterizing the Distortion of Some Simple Euclidean Embeddings

A Tutorial on Computational Geometry
A Tutorial on Computational GeometryA Tutorial on Computational Geometry
A Tutorial on Computational GeometryMinh-Tri Pham
 
convexHullsconvexHullsconvexHullsconvexHullsconvexHullsconvexHullsconvexHulls
convexHullsconvexHullsconvexHullsconvexHullsconvexHullsconvexHullsconvexHullsconvexHullsconvexHullsconvexHullsconvexHullsconvexHullsconvexHullsconvexHulls
convexHullsconvexHullsconvexHullsconvexHullsconvexHullsconvexHullsconvexHullsShanmuganathan C
 
The Persistent Homology of Distance Functions under Random Projection
The Persistent Homology of Distance Functions under Random ProjectionThe Persistent Homology of Distance Functions under Random Projection
The Persistent Homology of Distance Functions under Random ProjectionDon Sheehy
 
Lecture 03 lexical analysis
Lecture 03 lexical analysisLecture 03 lexical analysis
Lecture 03 lexical analysisIffat Anjum
 
A sweepline algorithm for Voronoi Diagrams
A sweepline algorithm for Voronoi DiagramsA sweepline algorithm for Voronoi Diagrams
A sweepline algorithm for Voronoi DiagramsSweta Sharma
 
Nondeterministic Finite Automata AFN.pdf
Nondeterministic Finite Automata AFN.pdfNondeterministic Finite Automata AFN.pdf
Nondeterministic Finite Automata AFN.pdfSergioUlisesRojasAla
 
Volume and edge skeleton computation in high dimensions
Volume and edge skeleton computation in high dimensionsVolume and edge skeleton computation in high dimensions
Volume and edge skeleton computation in high dimensionsVissarion Fisikopoulos
 
14th Athens Colloquium on Algorithms and Complexity (ACAC19)
14th Athens Colloquium on Algorithms and Complexity (ACAC19)14th Athens Colloquium on Algorithms and Complexity (ACAC19)
14th Athens Colloquium on Algorithms and Complexity (ACAC19)Apostolos Chalkis
 
E field dipole
E field dipoleE field dipole
E field dipoleFFMdeMul
 
Three dimensional geometry
Three dimensional geometryThree dimensional geometry
Three dimensional geometrynitishguptamaps
 
Maapr3
Maapr3Maapr3
Maapr3FNian
 
Calculus academic journal (sample)
Calculus academic journal (sample)Calculus academic journal (sample)
Calculus academic journal (sample)Vincentius Soesanto
 
Lines, planes, and hyperplanes
Lines, planes, and hyperplanesLines, planes, and hyperplanes
Lines, planes, and hyperplanesTarun Gehlot
 
Lines, planes, and hyperplanes
Lines, planes, and hyperplanesLines, planes, and hyperplanes
Lines, planes, and hyperplanesTarun Gehlot
 
Mba admission in india
Mba admission in indiaMba admission in india
Mba admission in indiaEdhole.com
 
Notes on Equation of Plane
Notes on Equation of PlaneNotes on Equation of Plane
Notes on Equation of PlaneHerbert Mujungu
 

Similar to Characterizing the Distortion of Some Simple Euclidean Embeddings (20)

A Tutorial on Computational Geometry
A Tutorial on Computational GeometryA Tutorial on Computational Geometry
A Tutorial on Computational Geometry
 
convexHullsconvexHullsconvexHullsconvexHullsconvexHullsconvexHullsconvexHulls
convexHullsconvexHullsconvexHullsconvexHullsconvexHullsconvexHullsconvexHullsconvexHullsconvexHullsconvexHullsconvexHullsconvexHullsconvexHullsconvexHulls
convexHullsconvexHullsconvexHullsconvexHullsconvexHullsconvexHullsconvexHulls
 
The Persistent Homology of Distance Functions under Random Projection
The Persistent Homology of Distance Functions under Random ProjectionThe Persistent Homology of Distance Functions under Random Projection
The Persistent Homology of Distance Functions under Random Projection
 
Lecture 03 lexical analysis
Lecture 03 lexical analysisLecture 03 lexical analysis
Lecture 03 lexical analysis
 
A sweepline algorithm for Voronoi Diagrams
A sweepline algorithm for Voronoi DiagramsA sweepline algorithm for Voronoi Diagrams
A sweepline algorithm for Voronoi Diagrams
 
Nondeterministic Finite Automata AFN.pdf
Nondeterministic Finite Automata AFN.pdfNondeterministic Finite Automata AFN.pdf
Nondeterministic Finite Automata AFN.pdf
 
Volume and edge skeleton computation in high dimensions
Volume and edge skeleton computation in high dimensionsVolume and edge skeleton computation in high dimensions
Volume and edge skeleton computation in high dimensions
 
14th Athens Colloquium on Algorithms and Complexity (ACAC19)
14th Athens Colloquium on Algorithms and Complexity (ACAC19)14th Athens Colloquium on Algorithms and Complexity (ACAC19)
14th Athens Colloquium on Algorithms and Complexity (ACAC19)
 
JC Vectors summary
JC Vectors summaryJC Vectors summary
JC Vectors summary
 
E field dipole
E field dipoleE field dipole
E field dipole
 
Three dimensional geometry
Three dimensional geometryThree dimensional geometry
Three dimensional geometry
 
Ch4 slides
Ch4 slidesCh4 slides
Ch4 slides
 
Maapr3
Maapr3Maapr3
Maapr3
 
Volume computation and applications
Volume computation and applications Volume computation and applications
Volume computation and applications
 
Muchtadi
MuchtadiMuchtadi
Muchtadi
 
Calculus academic journal (sample)
Calculus academic journal (sample)Calculus academic journal (sample)
Calculus academic journal (sample)
 
Lines, planes, and hyperplanes
Lines, planes, and hyperplanesLines, planes, and hyperplanes
Lines, planes, and hyperplanes
 
Lines, planes, and hyperplanes
Lines, planes, and hyperplanesLines, planes, and hyperplanes
Lines, planes, and hyperplanes
 
Mba admission in india
Mba admission in indiaMba admission in india
Mba admission in india
 
Notes on Equation of Plane
Notes on Equation of PlaneNotes on Equation of Plane
Notes on Equation of Plane
 

More from Don Sheehy

Some Thoughts on Sampling
Some Thoughts on SamplingSome Thoughts on Sampling
Some Thoughts on SamplingDon Sheehy
 
Sensors and Samples: A Homological Approach
Sensors and Samples:  A Homological ApproachSensors and Samples:  A Homological Approach
Sensors and Samples: A Homological ApproachDon Sheehy
 
Persistent Homology and Nested Dissection
Persistent Homology and Nested DissectionPersistent Homology and Nested Dissection
Persistent Homology and Nested DissectionDon Sheehy
 
Geometric and Topological Data Analysis
Geometric and Topological Data AnalysisGeometric and Topological Data Analysis
Geometric and Topological Data AnalysisDon Sheehy
 
Geometric Separators and the Parabolic Lift
Geometric Separators and the Parabolic LiftGeometric Separators and the Parabolic Lift
Geometric Separators and the Parabolic LiftDon Sheehy
 
A New Approach to Output-Sensitive Voronoi Diagrams and Delaunay Triangulations
A New Approach to Output-Sensitive Voronoi Diagrams and Delaunay TriangulationsA New Approach to Output-Sensitive Voronoi Diagrams and Delaunay Triangulations
A New Approach to Output-Sensitive Voronoi Diagrams and Delaunay TriangulationsDon Sheehy
 
Optimal Meshing
Optimal MeshingOptimal Meshing
Optimal MeshingDon Sheehy
 
Output-Sensitive Voronoi Diagrams and Delaunay Triangulations
Output-Sensitive Voronoi Diagrams and Delaunay Triangulations Output-Sensitive Voronoi Diagrams and Delaunay Triangulations
Output-Sensitive Voronoi Diagrams and Delaunay Triangulations Don Sheehy
 
Mesh Generation and Topological Data Analysis
Mesh Generation and Topological Data AnalysisMesh Generation and Topological Data Analysis
Mesh Generation and Topological Data AnalysisDon Sheehy
 
SOCG: Linear-Size Approximations to the Vietoris-Rips Filtration
SOCG: Linear-Size Approximations to the Vietoris-Rips FiltrationSOCG: Linear-Size Approximations to the Vietoris-Rips Filtration
SOCG: Linear-Size Approximations to the Vietoris-Rips FiltrationDon Sheehy
 
Linear-Size Approximations to the Vietoris-Rips Filtration - Presented at Uni...
Linear-Size Approximations to the Vietoris-Rips Filtration - Presented at Uni...Linear-Size Approximations to the Vietoris-Rips Filtration - Presented at Uni...
Linear-Size Approximations to the Vietoris-Rips Filtration - Presented at Uni...Don Sheehy
 
Minimax Rates for Homology Inference
Minimax Rates for Homology InferenceMinimax Rates for Homology Inference
Minimax Rates for Homology InferenceDon Sheehy
 
A Multicover Nerve for Geometric Inference
A Multicover Nerve for Geometric InferenceA Multicover Nerve for Geometric Inference
A Multicover Nerve for Geometric InferenceDon Sheehy
 
ATMCS: Linear-Size Approximations to the Vietoris-Rips Filtration
ATMCS: Linear-Size Approximations to the Vietoris-Rips FiltrationATMCS: Linear-Size Approximations to the Vietoris-Rips Filtration
ATMCS: Linear-Size Approximations to the Vietoris-Rips FiltrationDon Sheehy
 
New Bounds on the Size of Optimal Meshes
New Bounds on the Size of Optimal MeshesNew Bounds on the Size of Optimal Meshes
New Bounds on the Size of Optimal MeshesDon Sheehy
 
Flips in Computational Geometry
Flips in Computational GeometryFlips in Computational Geometry
Flips in Computational GeometryDon Sheehy
 
Beating the Spread: Time-Optimal Point Meshing
Beating the Spread: Time-Optimal Point MeshingBeating the Spread: Time-Optimal Point Meshing
Beating the Spread: Time-Optimal Point MeshingDon Sheehy
 
Ball Packings and Fat Voronoi Diagrams
Ball Packings and Fat Voronoi DiagramsBall Packings and Fat Voronoi Diagrams
Ball Packings and Fat Voronoi DiagramsDon Sheehy
 
Learning with Nets and Meshes
Learning with Nets and MeshesLearning with Nets and Meshes
Learning with Nets and MeshesDon Sheehy
 
On Nets and Meshes
On Nets and MeshesOn Nets and Meshes
On Nets and MeshesDon Sheehy
 

More from Don Sheehy (20)

Some Thoughts on Sampling
Some Thoughts on SamplingSome Thoughts on Sampling
Some Thoughts on Sampling
 
Sensors and Samples: A Homological Approach
Sensors and Samples:  A Homological ApproachSensors and Samples:  A Homological Approach
Sensors and Samples: A Homological Approach
 
Persistent Homology and Nested Dissection
Persistent Homology and Nested DissectionPersistent Homology and Nested Dissection
Persistent Homology and Nested Dissection
 
Geometric and Topological Data Analysis
Geometric and Topological Data AnalysisGeometric and Topological Data Analysis
Geometric and Topological Data Analysis
 
Geometric Separators and the Parabolic Lift
Geometric Separators and the Parabolic LiftGeometric Separators and the Parabolic Lift
Geometric Separators and the Parabolic Lift
 
A New Approach to Output-Sensitive Voronoi Diagrams and Delaunay Triangulations
A New Approach to Output-Sensitive Voronoi Diagrams and Delaunay TriangulationsA New Approach to Output-Sensitive Voronoi Diagrams and Delaunay Triangulations
A New Approach to Output-Sensitive Voronoi Diagrams and Delaunay Triangulations
 
Optimal Meshing
Optimal MeshingOptimal Meshing
Optimal Meshing
 
Output-Sensitive Voronoi Diagrams and Delaunay Triangulations
Output-Sensitive Voronoi Diagrams and Delaunay Triangulations Output-Sensitive Voronoi Diagrams and Delaunay Triangulations
Output-Sensitive Voronoi Diagrams and Delaunay Triangulations
 
Mesh Generation and Topological Data Analysis
Mesh Generation and Topological Data AnalysisMesh Generation and Topological Data Analysis
Mesh Generation and Topological Data Analysis
 
SOCG: Linear-Size Approximations to the Vietoris-Rips Filtration
SOCG: Linear-Size Approximations to the Vietoris-Rips FiltrationSOCG: Linear-Size Approximations to the Vietoris-Rips Filtration
SOCG: Linear-Size Approximations to the Vietoris-Rips Filtration
 
Linear-Size Approximations to the Vietoris-Rips Filtration - Presented at Uni...
Linear-Size Approximations to the Vietoris-Rips Filtration - Presented at Uni...Linear-Size Approximations to the Vietoris-Rips Filtration - Presented at Uni...
Linear-Size Approximations to the Vietoris-Rips Filtration - Presented at Uni...
 
Minimax Rates for Homology Inference
Minimax Rates for Homology InferenceMinimax Rates for Homology Inference
Minimax Rates for Homology Inference
 
A Multicover Nerve for Geometric Inference
A Multicover Nerve for Geometric InferenceA Multicover Nerve for Geometric Inference
A Multicover Nerve for Geometric Inference
 
ATMCS: Linear-Size Approximations to the Vietoris-Rips Filtration
ATMCS: Linear-Size Approximations to the Vietoris-Rips FiltrationATMCS: Linear-Size Approximations to the Vietoris-Rips Filtration
ATMCS: Linear-Size Approximations to the Vietoris-Rips Filtration
 
New Bounds on the Size of Optimal Meshes
New Bounds on the Size of Optimal MeshesNew Bounds on the Size of Optimal Meshes
New Bounds on the Size of Optimal Meshes
 
Flips in Computational Geometry
Flips in Computational GeometryFlips in Computational Geometry
Flips in Computational Geometry
 
Beating the Spread: Time-Optimal Point Meshing
Beating the Spread: Time-Optimal Point MeshingBeating the Spread: Time-Optimal Point Meshing
Beating the Spread: Time-Optimal Point Meshing
 
Ball Packings and Fat Voronoi Diagrams
Ball Packings and Fat Voronoi DiagramsBall Packings and Fat Voronoi Diagrams
Ball Packings and Fat Voronoi Diagrams
 
Learning with Nets and Meshes
Learning with Nets and MeshesLearning with Nets and Meshes
Learning with Nets and Meshes
 
On Nets and Meshes
On Nets and MeshesOn Nets and Meshes
On Nets and Meshes
 

Recently uploaded

dkNET Webinar "Texera: A Scalable Cloud Computing Platform for Sharing Data a...
dkNET Webinar "Texera: A Scalable Cloud Computing Platform for Sharing Data a...dkNET Webinar "Texera: A Scalable Cloud Computing Platform for Sharing Data a...
dkNET Webinar "Texera: A Scalable Cloud Computing Platform for Sharing Data a...dkNET
 
IDENTIFICATION OF THE LIVING- forensic medicine
IDENTIFICATION OF THE LIVING- forensic medicineIDENTIFICATION OF THE LIVING- forensic medicine
IDENTIFICATION OF THE LIVING- forensic medicinesherlingomez2
 
GBSN - Microbiology (Unit 2)
GBSN - Microbiology (Unit 2)GBSN - Microbiology (Unit 2)
GBSN - Microbiology (Unit 2)Areesha Ahmad
 
High Class Escorts in Hyderabad ₹7.5k Pick Up & Drop With Cash Payment 969456...
High Class Escorts in Hyderabad ₹7.5k Pick Up & Drop With Cash Payment 969456...High Class Escorts in Hyderabad ₹7.5k Pick Up & Drop With Cash Payment 969456...
High Class Escorts in Hyderabad ₹7.5k Pick Up & Drop With Cash Payment 969456...chandars293
 
Pests of cotton_Borer_Pests_Binomics_Dr.UPR.pdf
Pests of cotton_Borer_Pests_Binomics_Dr.UPR.pdfPests of cotton_Borer_Pests_Binomics_Dr.UPR.pdf
Pests of cotton_Borer_Pests_Binomics_Dr.UPR.pdfPirithiRaju
 
Vip profile Call Girls In Lonavala 9748763073 For Genuine Sex Service At Just...
Vip profile Call Girls In Lonavala 9748763073 For Genuine Sex Service At Just...Vip profile Call Girls In Lonavala 9748763073 For Genuine Sex Service At Just...
Vip profile Call Girls In Lonavala 9748763073 For Genuine Sex Service At Just...Monika Rani
 
Chemical Tests; flame test, positive and negative ions test Edexcel Internati...
Chemical Tests; flame test, positive and negative ions test Edexcel Internati...Chemical Tests; flame test, positive and negative ions test Edexcel Internati...
Chemical Tests; flame test, positive and negative ions test Edexcel Internati...ssuser79fe74
 
biology HL practice questions IB BIOLOGY
biology HL practice questions IB BIOLOGYbiology HL practice questions IB BIOLOGY
biology HL practice questions IB BIOLOGY1301aanya
 
9654467111 Call Girls In Raj Nagar Delhi Short 1500 Night 6000
9654467111 Call Girls In Raj Nagar Delhi Short 1500 Night 60009654467111 Call Girls In Raj Nagar Delhi Short 1500 Night 6000
9654467111 Call Girls In Raj Nagar Delhi Short 1500 Night 6000Sapana Sha
 
Dopamine neurotransmitter determination using graphite sheet- graphene nano-s...
Dopamine neurotransmitter determination using graphite sheet- graphene nano-s...Dopamine neurotransmitter determination using graphite sheet- graphene nano-s...
Dopamine neurotransmitter determination using graphite sheet- graphene nano-s...Mohammad Khajehpour
 
COMPUTING ANTI-DERIVATIVES (Integration by SUBSTITUTION)
COMPUTING ANTI-DERIVATIVES(Integration by SUBSTITUTION)COMPUTING ANTI-DERIVATIVES(Integration by SUBSTITUTION)
COMPUTING ANTI-DERIVATIVES (Integration by SUBSTITUTION)AkefAfaneh2
 
STS-UNIT 4 CLIMATE CHANGE POWERPOINT PRESENTATION
STS-UNIT 4 CLIMATE CHANGE POWERPOINT PRESENTATIONSTS-UNIT 4 CLIMATE CHANGE POWERPOINT PRESENTATION
STS-UNIT 4 CLIMATE CHANGE POWERPOINT PRESENTATIONrouseeyyy
 
Connaught Place, Delhi Call girls :8448380779 Model Escorts | 100% verified
Connaught Place, Delhi Call girls :8448380779 Model Escorts | 100% verifiedConnaught Place, Delhi Call girls :8448380779 Model Escorts | 100% verified
Connaught Place, Delhi Call girls :8448380779 Model Escorts | 100% verifiedDelhi Call girls
 
Call Girls Alandi Call Me 7737669865 Budget Friendly No Advance Booking
Call Girls Alandi Call Me 7737669865 Budget Friendly No Advance BookingCall Girls Alandi Call Me 7737669865 Budget Friendly No Advance Booking
Call Girls Alandi Call Me 7737669865 Budget Friendly No Advance Bookingroncy bisnoi
 
Module for Grade 9 for Asynchronous/Distance learning
Module for Grade 9 for Asynchronous/Distance learningModule for Grade 9 for Asynchronous/Distance learning
Module for Grade 9 for Asynchronous/Distance learninglevieagacer
 
SCIENCE-4-QUARTER4-WEEK-4-PPT-1 (1).pptx
SCIENCE-4-QUARTER4-WEEK-4-PPT-1 (1).pptxSCIENCE-4-QUARTER4-WEEK-4-PPT-1 (1).pptx
SCIENCE-4-QUARTER4-WEEK-4-PPT-1 (1).pptxRizalinePalanog2
 
Zoology 5th semester notes( Sumit_yadav).pdf
Zoology 5th semester notes( Sumit_yadav).pdfZoology 5th semester notes( Sumit_yadav).pdf
Zoology 5th semester notes( Sumit_yadav).pdfSumit Kumar yadav
 
Kochi ❤CALL GIRL 84099*07087 ❤CALL GIRLS IN Kochi ESCORT SERVICE❤CALL GIRL
Kochi ❤CALL GIRL 84099*07087 ❤CALL GIRLS IN Kochi ESCORT SERVICE❤CALL GIRLKochi ❤CALL GIRL 84099*07087 ❤CALL GIRLS IN Kochi ESCORT SERVICE❤CALL GIRL
Kochi ❤CALL GIRL 84099*07087 ❤CALL GIRLS IN Kochi ESCORT SERVICE❤CALL GIRLkantirani197
 

Recently uploaded (20)

dkNET Webinar "Texera: A Scalable Cloud Computing Platform for Sharing Data a...
dkNET Webinar "Texera: A Scalable Cloud Computing Platform for Sharing Data a...dkNET Webinar "Texera: A Scalable Cloud Computing Platform for Sharing Data a...
dkNET Webinar "Texera: A Scalable Cloud Computing Platform for Sharing Data a...
 
IDENTIFICATION OF THE LIVING- forensic medicine
IDENTIFICATION OF THE LIVING- forensic medicineIDENTIFICATION OF THE LIVING- forensic medicine
IDENTIFICATION OF THE LIVING- forensic medicine
 
GBSN - Microbiology (Unit 2)
GBSN - Microbiology (Unit 2)GBSN - Microbiology (Unit 2)
GBSN - Microbiology (Unit 2)
 
High Class Escorts in Hyderabad ₹7.5k Pick Up & Drop With Cash Payment 969456...
High Class Escorts in Hyderabad ₹7.5k Pick Up & Drop With Cash Payment 969456...High Class Escorts in Hyderabad ₹7.5k Pick Up & Drop With Cash Payment 969456...
High Class Escorts in Hyderabad ₹7.5k Pick Up & Drop With Cash Payment 969456...
 
Pests of cotton_Borer_Pests_Binomics_Dr.UPR.pdf
Pests of cotton_Borer_Pests_Binomics_Dr.UPR.pdfPests of cotton_Borer_Pests_Binomics_Dr.UPR.pdf
Pests of cotton_Borer_Pests_Binomics_Dr.UPR.pdf
 
Vip profile Call Girls In Lonavala 9748763073 For Genuine Sex Service At Just...
Vip profile Call Girls In Lonavala 9748763073 For Genuine Sex Service At Just...Vip profile Call Girls In Lonavala 9748763073 For Genuine Sex Service At Just...
Vip profile Call Girls In Lonavala 9748763073 For Genuine Sex Service At Just...
 
Chemical Tests; flame test, positive and negative ions test Edexcel Internati...
Chemical Tests; flame test, positive and negative ions test Edexcel Internati...Chemical Tests; flame test, positive and negative ions test Edexcel Internati...
Chemical Tests; flame test, positive and negative ions test Edexcel Internati...
 
biology HL practice questions IB BIOLOGY
biology HL practice questions IB BIOLOGYbiology HL practice questions IB BIOLOGY
biology HL practice questions IB BIOLOGY
 
9654467111 Call Girls In Raj Nagar Delhi Short 1500 Night 6000
9654467111 Call Girls In Raj Nagar Delhi Short 1500 Night 60009654467111 Call Girls In Raj Nagar Delhi Short 1500 Night 6000
9654467111 Call Girls In Raj Nagar Delhi Short 1500 Night 6000
 
Dopamine neurotransmitter determination using graphite sheet- graphene nano-s...
Dopamine neurotransmitter determination using graphite sheet- graphene nano-s...Dopamine neurotransmitter determination using graphite sheet- graphene nano-s...
Dopamine neurotransmitter determination using graphite sheet- graphene nano-s...
 
COMPUTING ANTI-DERIVATIVES (Integration by SUBSTITUTION)
COMPUTING ANTI-DERIVATIVES(Integration by SUBSTITUTION)COMPUTING ANTI-DERIVATIVES(Integration by SUBSTITUTION)
COMPUTING ANTI-DERIVATIVES (Integration by SUBSTITUTION)
 
STS-UNIT 4 CLIMATE CHANGE POWERPOINT PRESENTATION
STS-UNIT 4 CLIMATE CHANGE POWERPOINT PRESENTATIONSTS-UNIT 4 CLIMATE CHANGE POWERPOINT PRESENTATION
STS-UNIT 4 CLIMATE CHANGE POWERPOINT PRESENTATION
 
Connaught Place, Delhi Call girls :8448380779 Model Escorts | 100% verified
Connaught Place, Delhi Call girls :8448380779 Model Escorts | 100% verifiedConnaught Place, Delhi Call girls :8448380779 Model Escorts | 100% verified
Connaught Place, Delhi Call girls :8448380779 Model Escorts | 100% verified
 
Call Girls Alandi Call Me 7737669865 Budget Friendly No Advance Booking
Call Girls Alandi Call Me 7737669865 Budget Friendly No Advance BookingCall Girls Alandi Call Me 7737669865 Budget Friendly No Advance Booking
Call Girls Alandi Call Me 7737669865 Budget Friendly No Advance Booking
 
Site Acceptance Test .
Site Acceptance Test                    .Site Acceptance Test                    .
Site Acceptance Test .
 
Clean In Place(CIP).pptx .
Clean In Place(CIP).pptx                 .Clean In Place(CIP).pptx                 .
Clean In Place(CIP).pptx .
 
Module for Grade 9 for Asynchronous/Distance learning
Module for Grade 9 for Asynchronous/Distance learningModule for Grade 9 for Asynchronous/Distance learning
Module for Grade 9 for Asynchronous/Distance learning
 
SCIENCE-4-QUARTER4-WEEK-4-PPT-1 (1).pptx
SCIENCE-4-QUARTER4-WEEK-4-PPT-1 (1).pptxSCIENCE-4-QUARTER4-WEEK-4-PPT-1 (1).pptx
SCIENCE-4-QUARTER4-WEEK-4-PPT-1 (1).pptx
 
Zoology 5th semester notes( Sumit_yadav).pdf
Zoology 5th semester notes( Sumit_yadav).pdfZoology 5th semester notes( Sumit_yadav).pdf
Zoology 5th semester notes( Sumit_yadav).pdf
 
Kochi ❤CALL GIRL 84099*07087 ❤CALL GIRLS IN Kochi ESCORT SERVICE❤CALL GIRL
Kochi ❤CALL GIRL 84099*07087 ❤CALL GIRLS IN Kochi ESCORT SERVICE❤CALL GIRLKochi ❤CALL GIRL 84099*07087 ❤CALL GIRLS IN Kochi ESCORT SERVICE❤CALL GIRL
Kochi ❤CALL GIRL 84099*07087 ❤CALL GIRLS IN Kochi ESCORT SERVICE❤CALL GIRL
 

Characterizing the Distortion of Some Simple Euclidean Embeddings

  • 1. Characterizing the Distortion of Some Simple Euclidean Embeddings Jonathan Lenchner*, Krzysztof P. Onak*, Don Sheehy**, and Liu Yang* ! ! *IBM **University of Connecticut
  • 2. Finite Euclidean Metrics Finite Point Sets in Euclidean Space Treat the point set P as a finite metric space (P,d). d(p, q) := kp qk = q (px qx)2 + (py qy)2
  • 5. Embeddings and Distortion P Q Let ⇧ : P ! Q be a bijection. ⇧ is t-Lipschitz if d(p, q) < t d(⇧(p), ⇧(q)) for all p, q 2 P.
  • 6. Embeddings and Distortion P Q Let ⇧ : P ! Q be a bijection. ⇧ is t-Lipschitz if d(p, q) < t d(⇧(p), ⇧(q)) for all p, q 2 P. The distortion of ⇧ is the min t such that ⇧ and ⇧ 1 are t-Lipschitz.
  • 7. Embeddings and Distortion P Q Let ⇧ : P ! Q be a bijection. ⇧ is t-Lipschitz if d(p, q) < t d(⇧(p), ⇧(q)) for all p, q 2 P. The distortion of ⇧ is the min t such that ⇧ and ⇧ 1 are t-Lipschitz. Dist(⇧) := maxp,q2P max( d(p,q) d(⇧(p),⇧(q)) , d(⇧(p),⇧(q)) d(p,q) )
  • 8. Lower Bounds [Badiou et al.] Embedding n evenly spaced points on a circle into a line requires ⌦( p n) distortion.
  • 9. Lower Bounds [Badiou et al.] Embedding n evenly spaced points on a circle into a line requires ⌦( p n) distortion.
  • 10. Lower Bounds [Badiou et al.] Proof Idea: Lipschitz Extensions Borsuk-Ulam Theorem Embedding n evenly spaced points on a circle into a line requires ⌦( p n) distortion.
  • 11. Lower Bounds [Badiou et al.] Proof Idea: Lipschitz Extensions Borsuk-Ulam Theorem Embedding n evenly spaced points on a circle into a line requires ⌦( p n) distortion. ⌦(n1/4 ) distortion for embedding a sphere into a plane.
  • 12. Embedding in Pairs of Lines
  • 13. Embedding in Pairs of Lines Gap 1 2n
  • 14. Embedding in Pairs of Lines Between lines  1 2 p n Gap 1 2n
  • 15. Embedding in Pairs of Lines Between lines  1 2 p n Gap 1 2n Resulting distortion is ⇥( p n)
  • 16. Embedding in Pairs of Lines Between lines  1 2 p n Gap 1 2n Resulting distortion is ⇥( p n) Distortion is ⇥(n1/4 ) for embedding sphere to two planes.
  • 20. Embedding in Triples of Lines Distortion is constant.
  • 21. Embedding in Triples of Lines Distortion is constant. Similarly, embedding points a on sphere to 4 planes can also be done with constant distortion. ! Open: What about embedding into 3 planes?
  • 22. One Point Off the Line/Plane q p a b
  • 23. One Point Off the Line/Plane p n q p a b
  • 24. One Point Off the Line/Plane p n Distortion O(n1/4 ) is possible. q p a b
  • 25. One Point Off the Line/Plane Lemma Consider a collection of n points on a line, each point one unit from the next, together with one additional point at height p n above the center point of the points on the line. Then any embedding of these points into a line has distortion ⌦(n1/4 ) p n Distortion O(n1/4 ) is possible. q p a b
  • 26. One Point Off the Line/Plane Lemma Consider a collection of n points on a line, each point one unit from the next, together with one additional point at height p n above the center point of the points on the line. Then any embedding of these points into a line has distortion ⌦(n1/4 ) p n Distortion O(n1/4 ) is possible. Proof Idea: If q is not on one end after the embedding, then it forces two adjacent points to be stretched. Otherwise, the n/4 nearest points on the line to q must be from the middle half. It follows that a or b separates a pair of adjacent points from the middle half. q p a b
  • 27. One Point Off the Line/Plane p n q p a b q Case 1: If q is not on the end, it separates c,d (previously adjacent pts). c d
  • 28. One Point Off the Line/Plane p n q p a b middle half q Case 2: If q is on the end, either a or b separates c, d (previously adjacent pts from middle half). c d a The n/4 points closest to q must all be from the middle half. Otherwise, dist(q,p) is stretched
  • 30. Open Questions Lower bounds for embedding into pairs of lines/planes.
  • 31. Open Questions Lower bounds for embedding into pairs of lines/planes. Extensions to measures and expected distortion.
  • 32. Open Questions Lower bounds for embedding into pairs of lines/planes. Extensions to measures and expected distortion. Bounds on embedding points on a sphere into 3 planes.
  • 33. Open Questions Lower bounds for embedding into pairs of lines/planes. Extensions to measures and expected distortion. Bounds on embedding points on a sphere into 3 planes. Upper bounds for one point off the line/plane.
  • 34. Open Questions Lower bounds for embedding into pairs of lines/planes. Extensions to measures and expected distortion. Bounds on embedding points on a sphere into 3 planes. Upper bounds for one point off the line/plane. Lower bounds for one point off a hyperplane in d>3.
  • 35. Open Questions Thanks. Lower bounds for embedding into pairs of lines/planes. Extensions to measures and expected distortion. Bounds on embedding points on a sphere into 3 planes. Upper bounds for one point off the line/plane. Lower bounds for one point off a hyperplane in d>3.