• Breaking News

    Friday, March 9, 2018

    Home Unlabelled CompSci Weekend SuperThread (March 09, 2018) Computer Science

    CompSci Weekend SuperThread (March 09, 2018) Computer Science

    March 09, 2018

    CompSci Weekend SuperThread (March 09, 2018) Computer Science

    CompSci Weekend SuperThread (March 09, 2018)

    Posted: 08 Mar 2018 05:06 PM PST

    /r/compsci strives to be the best online community for computer scientists. We moderate posts to keep things on topic.

    This Weekend SuperThread provides a discussion area for posts that might be off-topic normally. Anything Goes: post your questions, ideas, requests for help, musings, or whatever comes to mind as comments in this thread.

    Pointers

    • If you're looking to answer questions, sort by new comments.
    • If you're looking for answers, sort by top comment.
    • Upvote a question you've answered for visibility.
    • Downvoting is discouraged. Save it for discourteous content only.

    Caveats

    • It's not truly "Anything Goes". Please follow Reddiquette and use common sense.
    • Homework help questions are discouraged.
    submitted by /u/AutoModerator
    [link] [comments]

    [Computationl Geometry] What is the currently fastest way answer query a convex polygon?

    Posted: 08 Mar 2018 12:08 PM PST

    For the much easier case, querying when the query is in the form of a rectangle (whose boundaries align with the x and y axis), a 2d-tree would likely be the way to go.

    But what about cases where the boundaries don't allign to any axis or when the number of query boundaries is != 4?

    I tried to research, but either there has not much work been done, or I use the wrong words to search.

    Edit: A picture says more than thousands words "How to report which points lie within the red polygon in O(log n)-ish time?"

    Edit 2: Picture showed a non-convex polygon, fixed now.

    Edit 3: /u/conflicted_panda linked to a solution that runs in O(n log n + m) - that looks already useful to me, but if anyone happens to know faster approaches to that problem, I would be still grateful for them.

    submitted by /u/rect_pizza
    [link] [comments]

    Counting Unival Subtrees

    Posted: 08 Mar 2018 12:46 PM PST

    Implementing Conway's Game of Life

    Posted: 08 Mar 2018 04:07 PM PST

    Some questions about MySQL.

    Posted: 08 Mar 2018 09:00 AM PST

    Hello!

    So I have a trigger T, that inserts into relation R, whenever a tuple is inserted into relation S. I've also made a view V, which is separate from the trigger, that selects all the tuples from relation S. Would R and V be stored on disk? And also, what would happen to R or V, if a tuple is deleted from S?

    Thanks in advance!

    submitted by /u/NsfwOlive
    [link] [comments]
    Read more
    at

    No comments:

    Post a Comment