Article

Free access

Topologically sweeping an arrangement

Authors:

H Edelsbrunner,

L J GuibasAuthors Info & Claims

STOC '86: Proceedings of the eighteenth annual ACM symposium on Theory of computing

Pages 389 - 403

https://doi.org/10.1145/12130.12171

Published: 01 November 1986 Publication History

PDF eReader

References

[1]

Asano, T., Asano, T., Guibas, L.J., Hershberger, J., and Imai, H., Vislbility-polygon search and euclidean shortest paths. Proc. 26th Annual FOCS Symposium (1985), 155- 164.

Digital Library

Google Scholar

[2]

Aho, A.V., Hopcroft, J.E., and Ullman, J.D., The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.

Digital Library

Google Scholar

[3]

Avis, D., and Rappaport, D., Computing the largest empty convex subset of a set of polnts. Proc. 1st ACM Symp. on Comp. Geom. (1985), 161-167

Digital Library

Google Scholar

[4]

Chazelle, B.M., Guibas, L.J., and Lee, D.T., The power of geometric duality. BIT 25 (1985), 76-90.

Digital Library

Google Scholar

[5]

Chvathl, V., and Klincsek, G., Finding largest convex subsets. In Proc. l l t h SE Conf. on Combin., Graph Theory and Comp., 1980.

Google Scholar

[6]

Edelsbrunner, H., Constructing edge-skeletons in three dimensions dffth applications to power diagrams and dissecting three-dimensional point sets. Report F140, Inst. Inf. Process., Techn. Univ. Graz, 1984. To appear in A1- gorithmica. JEll Edelsbrunner, H., Arrangements and Geometric Computation. To be published.

Google Scholar

[7]

Edelsbrunner, H., Guibas, L.J., and Stolfi, J., Optimal point location in a monotone subdivision. DEC/SRC res. report 2, 1984. To appear in SIAM J. on Comp.

Google Scholar

[8]

Edelsbrunner, H., O'Rourke, J., and Seidel, R., Constructing arrangements of lines and hyperplanes with applications. SIAM J. on Comp., to appear.

Digital Library

Google Scholar

[9]

Edelsbrunner, H., Overmars, M.H., and Wood, D., Graphics in flatland: a case study. In Advances in Computing Research 1, F.P. Preparata, Ed., 1983, 35-59.

Google Scholar

[10]

Erdi~s, P., and Szekeres, G., A combinatorial problem in geometry. Composition Math. 2, 1935, 463-470.

Google Scholar

[11]

ErdSs, P., and Szekeres, G., On some extremum problems in elementary geometry. Ann. Univ. Sci. Budapest 3, 1960, 53-62.

Google Scholar

[12]

Edelsbrunner, H., and Welzl, E., Constructing belts in two-dimensional arrangements with applications. SIAM J. Comp., to appear.

Google Scholar

[13]

Fredman, M.L., On the information theoretic lower bound. Theor. Comp. Sc. 1 (1976), 355-361.

Crossref

Google Scholar

[14]

Fredman, M.L., and Tarjan, R.E., Fibonacci heaps and their uses in improved network optimization algorithms. Proc. 21st Ann. FOGS SYmposium, 1984, 338-346.

Digital Library

Google Scholar

[15]

Grfinbaum, B., Arrangements and Spreads. Reg. Conf. Ser. Math., AMS, 1972.

Crossref

Google Scholar

[16]

Guibas, L.J., On a space-time trade-off for a backtracking problem. In preparation.

Google Scholar

[17]

Guibas, L.J., and Stolfi, J., Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Trans. on Graphics 4, 1985, 74- 123.

Digital Library

Google Scholar

[18]

Harborth, H., Konvexe Fanfecke in ebenen Punkmengen. Elem. Math. 33, 1978, 116-118.

Google Scholar

[19]

Horton, J.D., Sets with no empty convex 7-yon. Canad. Math. Bull. 26, 1983, 482-484.

Crossref

Google Scholar

[20]

Knuth, D.E., The Art of Computer Programming, vol. I (Fundamental Algorithms). Addison-Wesley, 1971.

Digital Library

Google Scholar

[21]

Lee, D.T., Proximity and teachability in the plane. Ph.D. thesis, Dept. Else. Engin., Univ. of Illinois, 1979.

Digital Library

Google Scholar

[22]

Lee, D.T., and Preparata, F.P., Euclidean shortest paths in the presence of rectilinear barriers. Network 14, 1984, 393-410.

Crossref

Google Scholar

[23]

MeKenna, M., and Seidel, R., Finding the optimal of a convex polytope. Proe. 1st ACM Syrup. Geom., 1985, 24-28.

Digital Library

Google Scholar

[24]

Nievergelt, J., and Preparata, F.P., Plane-rithms for intersecting geometric figures. CACM 739-747.

Digital Library

Google Scholar

[25]

Preparata, F.P., and Shamos, M.I., Computational ometry~ an Introduction. Springer-Verlag, 1985.

Digital Library

Google Scholar

[26]

Sharir, M., personal communication, 1985.

Google Scholar

[27]

Tarjan, R.E., Amortized computational complexity. J. on Comp., to appear.

Google Scholar

[28]

Welzl, W., Constructing the visibility graph segments in O(n 2) time. Inf. Proc. Letters 20, 171.

Google Scholar

Cited By

View all

Xue JLi YJanardan R(2019)On the expected diameter, width, and complexity of a stochastic convex hullComputational Geometry10.1016/j.comgeo.2019.04.002Online publication date: Apr-2019
https://doi.org/10.1016/j.comgeo.2019.04.002
Halperin TWerman M(2018)An Epipolar Line from a Single Pixel2018 IEEE Winter Conference on Applications of Computer Vision (WACV)10.1109/WACV.2018.00113(983-991)Online publication date: Mar-2018
https://doi.org/10.1109/WACV.2018.00113
Varga DSziranyi TKiss ASporas LHavasi L(2015)A Multi-View Pedestrian Tracking Method in an Uncalibrated Camera NetworkProceedings of the 2015 IEEE International Conference on Computer Vision Workshop (ICCVW)10.1109/ICCVW.2015.33(184-191)Online publication date: 7-Dec-2015
https://dl.acm.org/doi/10.1109/ICCVW.2015.33
Show More Cited By

Index Terms

Topologically sweeping an arrangement
1. Theory of computation
  1. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

Interactive modeling of topologically complex geometric detail

Volume textures aligned with a surface can be used to add topologically complex geometric detail to objects in an efficient way, while retaining an underlying simple surface structure.Adding a volume texture to a surface requires more than a ...
Interactive modeling of topologically complex geometric detail
SIGGRAPH '04: ACM SIGGRAPH 2004 Papers

Volume textures aligned with a surface can be used to add topologically complex geometric detail to objects in an efficient way, while retaining an underlying simple surface structure.Adding a volume texture to a surface requires more than a ...
Topologically consistent trimmed surface approximations based on triangular patches

A scheme to approximate the trimmed surfaces defined by two tensor-product surface patches, intersecting in a smooth curve segment that extends between diametrically opposite patch corners, is formulated. The trimmed surface approximations are specified ...

Comments

Information & Contributors

Information

Published In

STOC '86: Proceedings of the eighteenth annual ACM symposium on Theory of computing

November 1986

461 pages

ISBN:0897911938

DOI:10.1145/12130

Chairman:
Juris Hartmanis

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 1986

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC86

Sponsor:

SIGACT

STOC86: Eighteenth Annaul ACM Symposium on Theory of Computing

May 28 - 30, 1986

California, Berkeley, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

59
Total Citations
View Citations
1,041
Total Downloads

Downloads (Last 12 months)147
Downloads (Last 6 weeks)20

Reflects downloads up to 16 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Xue JLi YJanardan R(2019)On the expected diameter, width, and complexity of a stochastic convex hullComputational Geometry10.1016/j.comgeo.2019.04.002Online publication date: Apr-2019
https://doi.org/10.1016/j.comgeo.2019.04.002
Halperin TWerman M(2018)An Epipolar Line from a Single Pixel2018 IEEE Winter Conference on Applications of Computer Vision (WACV)10.1109/WACV.2018.00113(983-991)Online publication date: Mar-2018
https://doi.org/10.1109/WACV.2018.00113
Varga DSziranyi TKiss ASporas LHavasi L(2015)A Multi-View Pedestrian Tracking Method in an Uncalibrated Camera NetworkProceedings of the 2015 IEEE International Conference on Computer Vision Workshop (ICCVW)10.1109/ICCVW.2015.33(184-191)Online publication date: 7-Dec-2015
https://dl.acm.org/doi/10.1109/ICCVW.2015.33
Ngo PKenmochi YPassat NTalbot H(2015)On 2D constrained discrete rigid transformationsAnnals of Mathematics and Artificial Intelligence10.1007/s10472-014-9406-x75:1-2(163-193)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1007/s10472-014-9406-x
Chester SThomo AVenkatesh SWhitesides S(2014)Computing k-regret minimizing setsProceedings of the VLDB Endowment10.14778/2732269.27322757:5(389-400)Online publication date: 1-Jan-2014
https://dl.acm.org/doi/10.14778/2732269.2732275
Crumpton MAbbo ASloan S(2014)Discontinuity layout optimization with adaptive node refinementComputer Methods and Recent Advances in Geomechanics10.1201/b17435-21(141-146)Online publication date: 25-Sep-2014
https://doi.org/10.1201/b17435-21
Nealen AAlexa M(2011)The Creation and Modification of 3D Models Using Sketches and CurvesSketch-based Interfaces and Modeling10.1007/978-1-84882-812-4_9(225-253)Online publication date: 2011
https://doi.org/10.1007/978-1-84882-812-4_9
Jund TCazier DDufourd JBronsvoort WGonsor DRegli WGrandine TVandenbrande JGravesen JKeyser J(2009)Particle-based forecast mechanism for continuous collision detection in deformable environments2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling10.1145/1629255.1629274(147-158)Online publication date: 5-Oct-2009
https://dl.acm.org/doi/10.1145/1629255.1629274
Zimmermann JNealen AAlexa M(2008)Sketch-based InterfacesComputers and Graphics10.1016/j.cag.2008.05.00632:5(486-499)Online publication date: 1-Oct-2008
https://dl.acm.org/doi/10.1016/j.cag.2008.05.006
Zimmermann JNealen AAlexa MStahovich TAlvarado C(2007)SilSketchProceedings of the 4th Eurographics workshop on Sketch-based interfaces and modeling10.1145/1384429.1384438(23-30)Online publication date: 2-Aug-2007
https://dl.acm.org/doi/10.1145/1384429.1384438
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Interactive modeling of topologically complex geometric detail

Interactive modeling of topologically complex geometric detail

Topologically consistent trimmed surface approximations based on triangular patches