scispace - formally typeset
Open AccessProceedings ArticleDOI

Geometric intersection problems

Michael Ian Shamos, +1 more
- pp 208-215
TLDR
An O(N log N) algorithm is given to determine whether any two intersect and use it to detect whether two simple plane polygons intersect and to show that the Simplex method is not optimal.
Abstract
We develop optimal algorithms for forming the intersection of geometric objects in the plane and apply them to such diverse problems as linear programming, hidden-line elimination, and wire layout. Given N line segments in the plane, finding all intersecting pairs requires O(N2) time. We give an O(N log N) algorithm to determine whether any two intersect and use it to detect whether two simple plane polygons intersect. We employ an O(N log N) algorithm for finding the common intersection of N half-planes to show that the Simplex method is not optimal. The emphasis throughout is on obtaining upper and lower bounds and relating these results to other problems in computational geometry.

read more

Content maybe subject to copyright    Report

Resume of Michael Ian Shamos
Current to August 1, 2022
Education
A.B. (1968) Princeton University (Physics). Thesis: "Gravitational Radiation
Reaction." Advisor: John A. Wheeler.
M.A. (1970) Vassar College (Physics). Thesis: "An Absorber Theory of Acoustical
Radiation." Advisor: Morton A. Tavel.
M.S. (1972) American University (Technology of Management).
M.S. (1973) Yale University (Computer Science).
M.Phil. (1974) Yale University (Computer Science).
Ph.D. (1978) Yale University (Computer Science). Thesis: "Computational Geometry". Thesis
committee: David Dobkin, Martin H. Schultz, Stanley C. Eisenstat.
J.D. (1981) Duquesne University, cum laude.
Foreign Languages
French, Russian (good reading and technical translation skills, fair conversational ability).
Academic Experience
Distinguished Career Professor, Institute for Software Research and Language Technologies
Institute, School of Computer Science, Carnegie Mellon University (2001- )
Principal Systems Scientist (1998-2001)
Principal Lecturer (2002-2003). Teaching Professor (2003- )
Faculty, Tepper School of Business, Carnegie Mellon University (1999-2004).
Co-Director, Carnegie Mellon Institute for eCommerce (1998-2004 )
Vice-Chair, University Research Council (2000-2002)
Director, eBusiness Technology degree program, Carnegie Mellon (2003-2018)
Director, M.S. in Artificial Intelligence and Innovation, Carnegie Mellon (2018-)
Affiliated Faculty, CMU Center for Informed Democracy and Social-cybersecurity (2021-)
Core faculty, Privacy Engineering degree program (2013-)
Director, Universal Library, Carnegie Mellon University (1998-)
Visiting Professor, Faculty of Engineering, The University of Hong Kong (2001-2021)
Adjunct Faculty, Carnegie Mellon University, Department of Computer Science (1981-1998)

Assistant Professor, Carnegie Mellon University, Departments of Computer Science and
Mathematics (1975-81), Dept. of Statistics (1978-81).
Courses taught (Carnegie Mellon):
Algorithm Design and Analysis 15-451 (Comp. Sci.)
Intellectual Capital and its Protection 45-886 (MBA)
Ecommerce Technology 20-751 (MSEC program)
Electronic Payment Systems 20-753 (MSEC program), 96-774 (MSIT program)
Ecommerce Law and Regulation 46-840 (MSEC program)
Electronic Voting 17-803
Ubiquitous Computing, 96-761 (MSIT Program)
Electronic Payment Systems (MSIT Program)
Law of Computer Technology, 17-762/17-662/17-562 (2007-)
Artificial Intelligence and Future Markets, 11-561 (2018-)
Honors and Awards
Fellow, Society of the Sigma Xi (1974-83).
IBM Fellowship, Yale University (197475).
SIAM National Lecturer (197778).
Distinguished Lecturer (computer science), University of Rochester (1978); McGill University
(1979).
Duquesne University Law Review (1980–81).
Black & White Scotch Achiever’s Award (first annual, 1991, for contributions to bagpipe
musicography).
Industry Service Award of the Billiard and Bowling Institute of America, 1996 (for contributions
to billiard history).
Billiard Worldcup Association official referee (2001-)
Editorships
Editor-in-Chief, Journal of Privacy Technology (2003- 2006).
Member of Editorial Board, Electronic Commerce Research Journal (2000- ).
Member of Editorial Board, Pittsburgh Journal of Technology Law and Policy (1999-2003).

Dr. Shamos has reviewed scientific papers for Communications of the ACM, Mathematical
Reviews, IEEE Computer, IEEE Transactions on Computers, Information Processing Letters,
Journal of the ACM and the Journal of Computational Physics.
Contributing Editor, Billiards Digest magazine (1990- ).
Patents
Co-inventor with K. Srinivasan, U.S. Patent 7,330,839, "Method and System for Dynamic
Pricing," issued February 12, 2008.
Co-inventor with K. Srinivasan, U.S. Patent 7,421,278, "Method and Apparatus for Time-Aware
and Location-Aware Marketing," issued September 2, 2008.
Co-inventor with K. Srinivasan, U.S. Patent 7,747,465, "Determining the Effectiveness of
Internet Advertising," issued June 29, 2010.
Co-inventor with K. Srinivasan, U.S. Patent 8,195,197, "Method and Apparatus for Time-Aware
and Location-Aware Marketing," issued June 5, 2012.
Co-inventor with K. Srinivasan, U.S. Patent 8,280,773, "Method and Apparatus for Internet
Customer Retention," issued October 2, 2012.
Co-inventor with K. Srinivasan, U.S. Patent 9,456,299, "Method and Apparatus for Time-Aware
and Location-Aware Marketing," issued September 27, 2016.
Legal Experience
Special Counsel, Reed Smith LLP (2000-2003), electronic commerce law.
Shareholder, The Webb Law Firm (1996-2000), intellectual property law. Associate (1990-95).
Private practice of law (1987-90), intellectual property
Associate, law firm of Buchanan, Ingersoll, P. C. (1985-87)(now Buchanan Ingersoll & Rooney,
PC), Emerging Companies Department.
General Counsel, Carnegie Group, Inc. (1983-85), artificial intelligence company.
Private practice of law (1981-83), computer law.
Bar Admissions
Supreme Court of Pennsylvania (1981– ).

United States District Court for the Western District of Pennsylvania (1981 ).
United States Patent and Trademark Office (1981– ).
United States Tax Court (1982– ).
United States Court of Appeals for the Armed Forces (1982– ).
United States Court of Appeals for the Third Circuit (1982 ).
United States Supreme Court (1985– ).
United States Court of Appeals for the Federal Circuit (1985 ).
Expert Witness
Dr. Shamos has served as an expert witness in multiple computer software and electronic voting
cases. He has participated in the cases listed below. "D" indicates deposition testimony; "R"
indicates report, declaration or affidavit; "T" indicates trial testimony.
Total: 330 cases, including 254 patent, 20 electronic voting, 19 trade secret, 14 copyright.
Affidavits, reports or declarations submitted in 239 cases.
Deposed in 139 cases.
Testified at trial or hearing in 46 cases.
Participated in 7 ITC investigations, 3 reexams, 7 PGRs, 79 IPRs and 22 CBMs.
1. C.W. Communications, Inc. v. International Research Service, Inc., Civil Action No. 84-890,
(W.D. Pa. 1984), aff'd. Case No. 88-3331 (3d Cir., Oct. 31, 1988). Served as an expert for
plaintiff publisher as to the fame of its "Computerworld" trademark. Result: permanent
injunction entered against defendant. Judge McCune's Memorandum and Order states. "We
accept the conclusion drawn by Dr. Shamos." Firm: Webb, Burden Robinson & Webb (now the
Webb Law Firm). (D,T)
2. E.F. Hutton, Inc. v. Gipson (W.D. Pa. 1985). Served as an expert for defendant-
counterclaimant physician as to fraud in the inducement by a computer hardware
supplier. Plaintiff had provided capital financing for the purchase. Result: defendant was
awarded compensatory damages + $250,000 punitive damages. (D,T)
3. In re Comprehensive Business Systems, 119 B.R. 573 (S.D. Ohio 1990). Served as an expert
for a secured creditor in a bankruptcy case in which the creditor sought to obtain software still
in development for which it had advanced over $2 million in funding. Dr. Shamos opined as to
the value of the incomplete software. Result: the creditor was able to purchase the software
from the Trustee for $67,500. The Court referred in its opinion to "the testimony of the
eminent and impressive Dr. Shamos." (D,R,T)

4. Levinson Steel Co. v. American Software, Inc. et al., Civil Action No. 96-282, W.D. Pa.
(1996). Served as an expert for plaintiff in a case involving bad faith estimates of computer
processing capacity resulting in delivery of an inadequate system. Result: settlement in favor of
plaintiff in an undisclosed amount. Contact: Reed Smith LLP, 225 Fifth Ave., Pittsburgh, PA
15222. (D,R)
5. ASE Limited v. INCO Alloys International, Inc., Civil Action No. 98-1266, (W.D. Pa.
1998). Served as an expert for defendant concerning breach of computer services contract by
declaratory judgment plaintiff. Result: determination that defendant was free to seek services
from a different vendor. Firm: Reed Smith LLP, 225 Sixth Ave., Pittsburgh, PA 15222. Attorney:
Anthony Basinski, Esq. (D,T)
6. Twentieth Century Fox Film Corp. v. iCraveTV, 53 U.S.P.Q. 2d 1831 (W.D. Pa.
2000). Served as an expert for Plaintiffs concerning Internet technology used to stream video
from U.S. TV stations through web sites in Canada. Result: TRO and preliminary injunction
issued against defendants prohibiting continued infringement in the U.S. Firm: Reed Smith
LLP. Attorney: Gregory Jordan, Esq. (T)
7. Invited testimony before the British House of Lords, Subcommittee B of the European Union
Committee, April 20, 2000. Subject: European regulation of eCommerce. View testimony.
8. Universal Studios, Inc. v. Reimerdes, 111 F. Supp. 2d 294 (S.D.N.Y. 2000), aff'd 273 F.3d 429
(2d Cir. 2001). Served as an expert for plaintiff movie studios concerning accused software for
decrypting DVDs in the first case interpreting the Digital Millennium Copyright Act. Result:
permanent injunction issued in favor of plaintiffs on August 17, 2000. Contact: William Hart,
Esq., Proskauer Rose LLP. View testimony. View opinion. View appellate opinion. (D,T)
9. MercExchange, L.L.C. v. eBay, Inc. et al., Case No. 2:01-CV-736 (E.D. Va. 2001). Served as
an expert for defendant eBay in an infringement case concerning U.S. Patent 6,202,051 for
Internet auctions. Following Dr. Shamos' reports, Defendants obtained a summary judgment of
noninfringement of the subject patent. On the other patents, the case went to the U.S. Supreme
Court, which ruled that injunctions are not automatic in patent cases. Contact: Tim Teter, Esq.,
Cooley LLP. (D,R)
10. PowerQuest Corp. v. Quarterdeck Corp. et al., Case No. 2:97-CV-0783 (D. Utah
1997). Served as an expert for plaintiff PowerQuest in an infringement case concerning U. S.
Patents 5,675,769 and 5,706,472 for a method of resizing hard disk partitions. Dr. Shamos
testified at the Markman hearing. Case settled when one of the defendants acquired
plaintiff. Attorney: Gregg I. Anderson, Esq., formerly at Merchant & Gould, now an
Administrative Patent Judge at the Patent Trial and Appeal Board. (R,T)
11. Sightsound.Com Inc. v. N2K Inc. et al., C.A. 98-118 (W.D. Pa. 1998). Served as an expert for
defendants, including a subsidiary of Bertelsmann AG, concerning validity of U.S. Patents
5,191,573 and 5,966,440 for distribution of digital audio via telecommunications lines. Case

Citations
More filters
Journal ArticleDOI

Spatial Planning: A Configuration Space Approach

TL;DR: In this article, the authors propose an approach based on characterizing the position and orientation of an object as a single point in a configuration space, in which each coordinate represents a degree of freedom in the position or orientation of the object.
Book

Spatial planning: a configuration space approach

TL;DR: Algorithms for computing constraints on the position of an object due to the presence of ther objects, which arises in applications that require choosing how to arrange or how to move objects without collisions are presented.
Journal ArticleDOI

Algorithms for Reporting and Counting Geometric Intersections

TL;DR: Algorithms that count the number of pairwise intersections among a set of N objects in the plane and algorithms that report all such intersections are given.
Journal ArticleDOI

Optimal Search in Planar Subdivisions

TL;DR: This work presents a practical algorithm for subdivision search that achieves the same (optimal) worst case complexity bounds as the significantly more complex algorithm of Lipton and Tarjan, namely $O(\log n)$ search time with $O(n)$ storage.
Proceedings ArticleDOI

I-COLLIDE: an interactive and exact collision detection system for large-scale environments

TL;DR: An exact and interactive collision detection system for large-scale environments, I-COLLIDE, based on pruning multiple-object pairs using bounding boxes and performing exact collision detection between selected pairs of polyhedral models.
References
More filters
Book

The Design and Analysis of Computer Algorithms

TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Proceedings ArticleDOI

Closest-point problems

TL;DR: The purpose of this paper is to introduce a single geometric structure, called the Voronoi diagram, which can be constructed rapidly and contains all of the relevant proximity information in only linear space, and is used to obtain O(N log N) algorithms for most of the problems considered.
Proceedings ArticleDOI

Geometric complexity

TL;DR: An effort is made to recast classical theorems into a useful computational form and analogies are developed between constructibility questions in Euclidean geometry and computability questions in modern computational complexity.
Journal ArticleDOI

Measuring Concavity on a Rectangular Mosaic

TL;DR: A theory for describing and measuring the concavities of cellular complexes (digitized silhouettes) is developed that involves the use of the minimum-perimeter polygon and its convex hull.
Book ChapterDOI

On the complexity of computations under varying sets of primitives

TL;DR: The goal of the current research is the study of lower bounds on the complexity of a set of searching problems under various restrictions on the nature of the primitive operation used to determine each branch in a search tree.
Frequently Asked Questions (6)
Q1. Who was an expert for the plaintiff in a patent case?

Served as an expert for Patent Owner in inter-partes reviews of U.S. Patent 8,656,431, relating to a system for integrating television and IPTV channels into a global interactive program guide. 

Served as an expert for patent owner Fortinet, Inc. in a reexamination of U.S. Patent 7,968,744, drawn to systems and methods for allowing execution of authorized computer code and for protecting computer systems and networks from unauthorized code execution. 

Served as an expert for petitioner in inter partes reviews of U.S. Patent 8,295,862, relating to enabling short message system (SMS) communication without using IP services. 

Served as an expert for defendants Cardlytics, Inc., Regions Financial Corp., and Regions Bank in a case alleging infringement of U.S. Patents 7,499,872, 7,653,572 and 7,899,704, relating to methods for awarding rebates for credit and debit card purchases. 

Serving as an expert for defendants in an action alleging infringement of copyright in a computer program that operates storefronts for online purchase of school supplies. 

Judge Manck's opinion cites Dr. Shamos' testimony as follows: "the court finds Dr. Shamos, Defendants' expert, to be the true voice of reason and the most credible expert in this matter."